Eigenvalues and domination in graphs
Clemens Brand, Norbert Seifter (1996)
Mathematica Slovaca
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Clemens Brand, Norbert Seifter (1996)
Mathematica Slovaca
Similarity:
Kirkland, Steve (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Caro, Y., Roditty, Y. (1990)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Justin Southey, Michael Henning (2010)
Open Mathematics
Similarity:
A dominating set of a graph is a set of vertices such that every vertex not in the set is adjacent to a vertex in the set, while a paired-dominating set of a graph is a dominating set such that the subgraph induced by the dominating set contains a perfect matching. In this paper, we show that no minimum degree is sufficient to guarantee the existence of a disjoint dominating set and a paired-dominating set. However, we prove that the vertex set of every cubic graph can be partitioned...
Dragan Stevanović (2005)
Mathematica Bohemica
Similarity:
We find all connected graphs in which any two distinct vertices have exactly two common neighbors, thus solving a problem by B. Zelinka.
Gutman, Ivan, Fuji, Zhang (1986)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
Dragoš M. Cvetković (1991)
Publications de l'Institut Mathématique
Similarity:
Henning, Michael A., Yeo, Anders (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity: