Partitioning the vertices of a graph or its complement into a total dominating set and an independent dominating set

zbMATH Open1544.05084MaRDI QIDQ6562422

Michael A. Henning, Teresa W. Haynes

Publication date: 26 June 2024

Published in: The Australasian Journal of Combinatorics (Search for Journal in Brave)

zbMATH Keywords

independent setdominating setcomplementary prismprism of a graph

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• (Total) domination in prisms
• Domination and total domination in complementary prisms
• A note on domination and total domination in prisms
• Total domination in generalized prisms and a new domination invariant
• Convex and weakly convex domination in prism graphs
• Paired domination in prisms of graphs
• A Characterization of Graphs with Disjoint Dominating and Total Dominating Sets
• On the domination number of prisms of graphs
• Total Domination in Graphs
• Independent strong domination in complementary prisms
• Domination in Graphs: Core Concepts
• Structures of Domination in Graphs
• Topics in Domination in Graphs
• Independent transversal domination number in complementary prisms
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Partitioning the vertices of a graph or its complement into a total dominating set and an independent dominating set