ON RELATION BETWEEN SPECTRA OF GRAPHS AND THEIR DIGRAPH DECOMPOSITIONS
Dragan Stevanović, Sanja Stevanović (2009)
Publications de l'Institut Mathématique
Similarity:
Displaying similar documents to “Limit points of eigenvalues of (di)graphs”
ON RELATION BETWEEN SPECTRA OF GRAPHS AND THEIR DIGRAPH DECOMPOSITIONS
Acyclic digraphs and eigenvalues of -matrices.
McKay, Brendan D., Oggier, Frédérique E., Royle, Gordon F., Sloane, N.J.A., Wanless, Ian M., Wilf, Herbert S. (2004)
Journal of Integer Sequences [electronic only]
Similarity:
Main eigenvalues of real symmetric matrices with application to signed graphs
Zoran Stanić (2020)
Czechoslovak Mathematical Journal
Similarity:
An eigenvalue of a real symmetric matrix is called main if there is an associated eigenvector not orthogonal to the all-1 vector . Main eigenvalues are frequently considered in the framework of simple undirected graphs. In this study we generalize some results and then apply them to signed graphs.
Score lists of oriented tripartite graphs.
Shariefuddin, Pirzada, Merajuddin, Pirzada (1996)
Novi Sad Journal of Mathematics
Similarity:
Signed graphs with at most three eigenvalues
Farzaneh Ramezani, Peter Rowlinson, Zoran Stanić (2022)
Czechoslovak Mathematical Journal
Similarity:
We investigate signed graphs with just 2 or 3 distinct eigenvalues, mostly in the context of vertex-deleted subgraphs, the join of two signed graphs or association schemes.
The diameter and Laplacian eigenvalues of directed graphs.
Chung, Fan (2006)
The Electronic Journal of Combinatorics [electronic only]
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...