Dominating properties of star complements.
Liu, Bolian, Rowlinson, Peter (2000)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
Displaying similar documents to “Eigenvalues and domination in graphs”
Dominating properties of star complements.
Some Comments on the Eigenspaces of Graphs
Dragoš M. Cvetković (1991)
Publications de l'Institut Mathématique
Similarity:
Near threshold graphs.
Kirkland, Steve (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On certain eigenspaces of cographs.
Sander, Torsten (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
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.
The third smallest eigenvalue of the Laplacian matrix.
Pati, Sukanta (2001)
ELA. The Electronic Journal of Linear Algebra [electronic only]
Similarity:
Some properties of Laplacian eigenvalues for generalized star graphs
Kinkar Ch. Das (2005)
Kragujevac Journal of Mathematics
Similarity:
Some properties of the distance Laplacian eigenvalues of a graph
Mustapha Aouchiche, Pierre Hansen (2014)
Czechoslovak Mathematical Journal
Similarity:
The distance Laplacian of a connected graph is defined by , where is the distance matrix of , and is the diagonal matrix whose main entries are the vertex transmissions in . The spectrum of is called the distance Laplacian spectrum of . In the present paper, we investigate some particular distance Laplacian eigenvalues. Among other results, we show that the complete graph is the unique graph with only two distinct distance Laplacian eigenvalues. We establish some properties...
On a quasiordering of bipartite graphs.
Gutman, Ivan, Fuji, Zhang (1986)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity: