Open-independent, open-locating-dominating sets in complementary prism graphs

DOI10.1016/j.entcs.2019.08.023OpenAlexW2978226454WikidataQ113317409 ScholiaQ113317409MaRDI QIDQ2132352

Humberto J. Longo, Márcia R. Cappelle, Erika M. M. Coelho, Les R. Foulds

Publication date: 27 April 2022

Full work available at URL: https://doi.org/10.1016/j.entcs.2019.08.023

zbMATH Keywords

complexitycomplementary prisms of graphsopen-independent setsopen-locating-dominating sets

Mathematics Subject Classification ID

Mathematical programming (90Cxx) Graph theory (05Cxx)

Related Items (2)

Complexity results on open-independent, open-locating-dominating sets in complementary prism graphs ⋮ Open-independent, open-locating-dominating sets: structural aspects of some classes of graphs

Cites Work

• Recognizing some complementary products
• \(k\)-tuple total domination in complementary prisms
• Complexity properties of complementary prisms
• Domination and total domination in complementary prisms
• On a new class of codes for identifying vertices in graphs
• Open-independent, open-locating-dominating sets
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Open-independent, open-locating-dominating sets in complementary prism graphs