Eigenvalues and domination in graphs
Clemens Brand, Norbert Seifter (1996)
Mathematica Slovaca
Similarity:
Displaying similar documents to “Dominating properties of star complements.”
Eigenvalues and domination in graphs
Near threshold graphs.
Kirkland, Steve (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
A note on the k-domination number of a graph.
Caro, Y., Roditty, Y. (1990)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Graphs with disjoint dominating and paired-dominating sets
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...
All graphs in which each pair of distinct vertices has exactly two common neighbors
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.
On a quasiordering of bipartite graphs.
Gutman, Ivan, Fuji, Zhang (1986)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
Some Comments on the Eigenspaces of Graphs
Dragoš M. Cvetković (1991)
Publications de l'Institut Mathématique
Similarity:
A new upper bound on the total domination number of a graph.
Henning, Michael A., Yeo, Anders (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity: