Restrained domination in complementary prisms
From MaRDI portal
Publication:2895385
zbMATH Open1264.05091MaRDI QIDQ2895385FDOQ2895385
Authors: Wyatt J. Desormeaux, Teresa W. Haynes
Publication date: 2 July 2012
Published in: Utilitas Mathematica (Search for Journal in Brave)
Recommendations
cartesian productcomplementary prismcomplementary productgraph productrestrained domination numberrestrained domination set
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)
Cited In (17)
- \(k\)-tuple total restrained domination in complementary prisms
- Title not available (Why is that?)
- Locating-domination in complementary prisms
- Restrained domination in self-complementary graphs
- Domination and total domination in complementary prisms
- Hardness and efficiency on \(t\)-admissibility for graph operations
- Open-independent, open-locating-dominating sets: structural aspects of some classes of graphs
- Cycles in complementary prisms
- A note on domination and total domination in prisms
- Double domination in complementary prisms
- Independent domination in complementary prisms
- Title not available (Why is that?)
- The core of a complementary prism
- 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
- Recognizing some complementary products
This page was built for publication: Restrained domination in complementary prisms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2895385)