More Examples and Counterexamples for a Conjecture of Merrifield and Simmons
Yong Wang, Xueliang Li, Ivan Gutman (2001)
Publications de l'Institut Mathématique
Similarity:
Yong Wang, Xueliang Li, Ivan Gutman (2001)
Publications de l'Institut Mathématique
Similarity:
Gerd H. Fricke, Sandra M. Hedetniemi, Stephen T. Hedetniemi, Kevin R. Hutson (2011)
Discussiones Mathematicae Graph Theory
Similarity:
A set S ⊆ V is a dominating set of a graph G = (V,E) if every vertex in V -S is adjacent to at least one vertex in S. The domination number γ(G) of G equals the minimum cardinality of a dominating set S in G; we say that such a set S is a γ-set. In this paper we consider the family of all γ-sets in a graph G and we define the γ-graph G(γ) = (V(γ), E(γ)) of G to be the graph whose vertices V(γ) correspond 1-to-1 with the γ-sets of G, and two γ-sets, say D₁ and D₂, are adjacent in E(γ)...
Brešar, Boštjan (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Bohdan Zelinka (1989)
Časopis pro pěstování matematiky
Similarity:
Harishchandra S. Ramane, Asha B. Ganagi, Ivan Gutman (2012)
Kragujevac Journal of Mathematics
Similarity:
Mubayi, Dhruv (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Gutman, Ivan, Fuji, Zhang (1986)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
Fischer, Eldar (1999)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
John Georges, Jianwei Lin, David Mauro (2014)
Discussiones Mathematicae Graph Theory
Similarity:
Let K3n denote the Cartesian product Kn□Kn□Kn, where Kn is the complete graph on n vertices. We show that the domination number of K3n is [...]