On Unique Minimum Dominating Sets in Some Cartesian Product Graphs
Unique minimum vertex dominating sets in the Cartesian product of a graph with a complete graph are considered. We first give properties of such sets when they exist. We then show that when the first factor of the product is a tree, consideration of the tree alone is sufficient to determine if the p...
Main Author: | Hedetniemi Jason T. |
---|---|
Format: | Article |
Language: | English |
Published: |
Sciendo
2015-11-01
|
Series: | Discussiones Mathematicae Graph Theory |
Subjects: | |
Online Access: | https://doi.org/10.7151/dmgt.1822 |
Similar Items
-
-dominating -ended trees of -connected graphs
by: Masao Tsugaki, et al.
Published: (2017-12-01) -
Graphs with disjoint dominating and paired-dominating sets
by: Southey Justin, et al.
Published: (2010-06-01) -
Vertex sequences in graphs
by: Teresa W. Haynes, et al.
Published: (2021-03-01) -
On Graphs with Disjoint Dominating and 2-Dominating Sets
by: Henning Michael A., et al.
Published: (2013-03-01) -
A Note on Outer-Independent 2-Rainbow Domination in Graphs
by: Cabrera-Martínez, A.
Published: (2022)