Open-independent, open-locating-dominating sets: structural aspects of some classes of graphs
DOI10.46298/dmtcs.8440zbMath1497.05201arXiv2103.07972OpenAlexW3137825176MaRDI QIDQ5864729
Humberto J. Longo, Márcia R. Capelle, Erika M. M. Coelho, Les R. Foulds
Publication date: 8 June 2022
Published in: Discrete Mathematics & Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2103.07972
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) 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.
- Open neighborhood locating-dominating in trees
- Domination and total domination in complementary prisms
- Perfect edge domination and efficient edge domination in graphs
- On the geodetic number of complementary prisms
- Open locating-dominating sets in circulant graphs
- Open-independent, open-locating-dominating sets in complementary prism graphs
- Optimal open-locating-dominating sets in infinite triangular grids
- Cycles in complementary prisms
- Planar 3DM is NP-complete
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Open-independent, open-locating-dominating sets: structural aspects of some classes of graphs