Locating-domination in complementary prisms of paths and cycles
From MaRDI portal
Publication:3581920
zbMATH Open1211.05113MaRDI QIDQ3581920FDOQ3581920
Authors: Teresa W. Haynes, Kristin R. S. Holmes, Denise Koessler, Louis Sewell
Publication date: 2 September 2010
Recommendations
Cartesian productlocating-domination numbercomplementary prismcomplementary productgraph productshareunit allocation function
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Paths and cycles (05C38)
Cited In (9)
- Locating-domination in complementary prisms
- Open-independent, open-locating-dominating sets: structural aspects of some classes of graphs
- Some results on the the \(b\)-chromatic number in complementary prism graphs
- Identifying codes in the complementary prism of cycles
- The geodetic hop domination number of complementary prisms
- Some results on the open locating-total domination number in graphs
- Complexity properties of complementary prisms
- Complexity results on open-independent, open-locating-dominating sets in complementary prism graphs
- Open-independent, open-locating-dominating sets in complementary prism graphs
This page was built for publication: Locating-domination in complementary prisms of paths and cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3581920)