\(k\)-tuple total domination in complementary prisms
From MaRDI portal
Publication:410666
DOI10.5402/2011/681274zbMath1238.05197WikidataQ58689971 ScholiaQ58689971MaRDI QIDQ410666
Publication date: 3 April 2012
Published in: ISRN Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.5402/2011/681274
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
Related Items
On the double total dominator chromatic number of graphs, Open-independent, open-locating-dominating sets: structural aspects of some classes of graphs, Recognizing some complementary products, 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, Hardness and efficiency on \(t\)-admissibility for graph operations, Cycles in complementary prisms, \(k\)-tuple total restrained domination in complementary prisms
Cites Work