Complexity results on open-independent, open-locating-dominating sets in complementary prism graphs

DOI10.1016/j.dam.2022.04.010zbMath1502.05180OpenAlexW4280637729MaRDI QIDQ2091788

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

Publication date: 2 November 2022

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2022.04.010

zbMATH Keywords

complementary prismopen-independent setopen-locating-dominating set

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Recognizing some complementary products
• \(k\)-tuple total domination in complementary prisms
• Complexity properties of complementary prisms
• Identification, location-domination and metric dimension on interval and permutation graphs. I: Bounds.
• Domination and total domination in complementary prisms
• On the geodetic number of complementary prisms
• Open-independent, open-locating-dominating sets in complementary prism graphs
• Optimal open-locating-dominating sets in infinite triangular grids
• Cycles in complementary prisms
• Nordhaus-Gaddum bounds for locating domination
• On a new class of codes for identifying vertices in graphs
• Open-independent, open-locating-dominating sets
• The open-locating-dominating number of some convex polytopes
• Some results on the b-chromatic number in complementary prism graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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