On unique minimum dominating sets in some Cartesian product graphs

DOI10.7151/dmgt.1822zbMath1327.05259OpenAlexW2575135123MaRDI QIDQ891308

Jason T. Hedetniemi

Publication date: 17 November 2015

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.1822

zbMATH Keywords

treesgraph productsvertex domination

Mathematics Subject Classification ID

Trees (05C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)

Related Items

More on the unimodality of domination polynomial of a graph ⋮ Unique minimum semipaired dominating sets in trees

Cites Work

• A linear algorithm for the domination number of a tree
• Graphs with unique minimum edge dominating sets and graphs with unique maximum independent sets of vertices
• Defending the Roman Empire from multiple attacks
• Defending the Roman Empire---a new strategy
• Maximum graphs with a unique minimum dominating set
• Unique irredundance, domination and independent domination in graphs
• Trees with unique minimum total dominating sets
• Block graphs with unique minimum dominating sets
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On unique minimum dominating sets in some Cartesian product graphs