Applications of Graph Spectra: an Introduction to the Literature
Dragoš Cvetković (2009)
Zbornik Radova
Similarity:
Dragoš Cvetković (2009)
Zbornik Radova
Similarity:
Jianfeng Wang, Haixing Zhao, Qiongxiang Huang (2012)
Czechoslovak Mathematical Journal
Similarity:
A multicone graph is defined to be the join of a clique and a regular graph. Based on Zhou and Cho's result [B. Zhou, H. H. Cho, Remarks on spectral radius and Laplacian eigenvalues of a graph, Czech. Math. J. 55 (130) (2005), 781–790], the spectral characterization of multicone graphs is investigated. Particularly, we determine a necessary and sufficient condition for two multicone graphs to be cospectral graphs and investigate the structures of graphs cospectral to a multicone graph....
Dragoš Cvetković (2012)
The Yugoslav Journal of Operations Research
Similarity:
Cvetkovic, Dragos M. (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:
Ghorbani, Ebrahim, Koolen, Jack H., Yang, Jae Young (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Chen, Yanqing, Wang, Ligong (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:
I.B. Lackovic, D.M. Cvetkovic (1976)
Publications de l'Institut Mathématique [Elektronische Ressource]
Similarity:
Petrović, Miroslav (1991)
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...
A. Alwardi, N. D. Soner, I. Gutman (2011)
Bulletin, Classe des Sciences Mathématiques et Naturelles, Sciences mathématiques
Similarity: