The Spectrum Of Line Graphs Of Some Infinite Graphs
Aleksandar Torgašev (1982)
Publications de l'Institut Mathématique
Similarity:
Aleksandar Torgašev (1982)
Publications de l'Institut Mathématique
Similarity:
Lepović, Mirko (1998)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
B. Arsić, I. Gutman, K. Ch. Das, K. Xu (2012)
Bulletin, Classe des Sciences Mathématiques et Naturelles, Sciences mathématiques
Similarity:
Chen, Yanqing, Wang, Ligong (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Torgasev, Aleksandar (1983)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
Torgašev, Aleksandar (1992)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
Petrović, Miroslav (1991)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
Cvetkovic, Dragos M. (1983)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
Gurusamy Rengasamy Vijayakumar (2013)
Discussiones Mathematicae Graph Theory
Similarity:
The infimum of the least eigenvalues of all finite induced subgraphs of an infinite graph is defined to be its least eigenvalue. In [P.J. Cameron, J.M. Goethals, J.J. Seidel and E.E. Shult, Line graphs, root systems, and elliptic geometry, J. Algebra 43 (1976) 305-327], the class of all finite graphs whose least eigenvalues ≥ −2 has been classified: (1) If a (finite) graph is connected and its least eigenvalue is at least −2, then either it is a generalized line graph or it is represented...
Hajiabolhassan, Hossein, Taherkhani, Ali (2010)
The Electronic Journal of Combinatorics [electronic only]
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...