On -ply domatic numbers of graphs
Bohdan Zelinka (1984)
Mathematica Slovaca
Similarity:
Displaying similar documents to “The B-Domatic Number of a Graph”
On -ply domatic numbers of graphs
A note on domatically critical and cocritical graphs
Igor Edmundovich Zverovich, Vadim E. Zverovich (1991)
Czechoslovak Mathematical Journal
Similarity:
Vertex degree sequences of graphs with small number of circuits.
Gutman, Ivan (1989)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
Some remarks on domatic numbers of graphs
Bohdan Zelinka (1981)
Časopis pro pěstování matematiky
Similarity:
A Note on Non-Dominating Set Partitions in Graphs
Wyatt J. Desormeaux, Teresa W. Haynes, Michael A. Henning (2016)
Discussiones Mathematicae Graph Theory
Similarity:
A set S of vertices of a graph G is a dominating set if every vertex not in S is adjacent to a vertex of S and is a total dominating set if every vertex of G is adjacent to a vertex of S. The cardinality of a minimum dominating (total dominating) set of G is called the domination (total domination) number. A set that does not dominate (totally dominate) G is called a non-dominating (non-total dominating) set of G. A partition of the vertices of G into non-dominating (non-total dominating)...