The Laplacian spread of tricyclic graphs.
Chen, Yanqing, Wang, Ligong (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Chen, Yanqing, Wang, Ligong (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Kirkland, Steve (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
B. Arsić, I. Gutman, K. Ch. Das, K. Xu (2012)
Bulletin, Classe des Sciences Mathématiques et Naturelles, Sciences mathématiques
Similarity:
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...
Ghorbani, Ebrahim, Koolen, Jack H., Yang, Jae Young (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Bo Lian Liu, Siyuan Chen (2010)
Czechoslovak Mathematical Journal
Similarity:
We give some algebraic conditions for -tough graphs in terms of the Laplacian eigenvalues and adjacency eigenvalues of graphs.
A. Alwardi, N. D. Soner, I. Gutman (2011)
Bulletin, Classe des Sciences Mathématiques et Naturelles, Sciences mathématiques
Similarity:
Torgašev, Aleksandar (1992)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity: