On the numbers of positive and negative eigenvalues of a graph.
Torgašev, Aleksandar (1992)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
Displaying similar documents to “The Laplacian spread of tricyclic graphs.”
On the numbers of positive and negative eigenvalues of a graph.
Relations between Kirchhoff index and Laplacian–energy–like invariant
B. Arsić, I. Gutman, K. Ch. Das, K. Xu (2012)
Bulletin, Classe des Sciences Mathématiques et Naturelles, Sciences mathématiques
Similarity:
Spectral characterization of multicone graphs
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....
Characterizations of the Family of All Generalized Line Graphs-Finite and Infinite-and Classification of the Family of All Graphs Whose Least Eigenvalues ≥ −2
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...
Some results on graphs with at most two positive eigenvalues.
Petrović, Miroslav (1991)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
Discussing graph theory with a computer. II: Theorems suggested by the computer.
Cvetkovic, Dragos M. (1983)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
Eigenvalue Bounds for the Signless Laplacian
Dragoš Cvetković, Peter Rowlinson, Slobodan Simić (2007)
Publications de l'Institut Mathématique
Similarity:
Applications of Graph Spectra: an Introduction to the Literature
Dragoš Cvetković (2009)
Zbornik Radova
Similarity:
Applications of Graph Spectra: An Introduction to the Literature
Dragoš Cvetković (2011)
Zbornik Radova
Similarity:
Graph equations, graph inequalities and a fixed point theorem.
I.B. Lackovic, D.M. Cvetkovic (1976)
Publications de l'Institut Mathématique [Elektronische Ressource]
Similarity:
Note on enumeration of labeled split graphs
Vladislav Bína, Jiří Přibil (2015)
Commentationes Mathematicae Universitatis Carolinae
Similarity:
The paper brings explicit formula for enumeration of vertex-labeled split graphs with given number of vertices. The authors derive this formula combinatorially using an auxiliary assertion concerning number of split graphs with given clique number. In conclusion authors discuss enumeration of vertex-labeled bipartite graphs, i.e., a graphical class defined in a similar manner to the class of split graphs.