Nonsingular mixed graphs with few eigenvalues greater than two
From MaRDI portal
Publication:2372430
DOI10.1016/j.ejc.2006.07.004zbMath1122.05058OpenAlexW2059712913MaRDI QIDQ2372430
Shi-Cai Gong, Ying-Ying Tan, Yi Wang, Jun Zhou, Yi-Zheng Fan
Publication date: 27 July 2007
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2006.07.004
Related Items (4)
On the distribution of Laplacian eigenvalues of a graph ⋮ Signless Laplacian eigenvalues and circumference of graphs ⋮ Vertex-connectivity, chromatic number, domination number, maximum degree and Laplacian eigenvalue distribution ⋮ Maximizing signless Laplacian or adjacency spectral radius of graphs subject to fixed connectivity
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The Laplacian spectrum of a mixed graph
- Laplacian matrices of graphs: A survey
- Graphs with fourth Laplacian eigenvalue less than two
- On spectral integral variations of mixed graphs
- Bipartite graphs with small third Laplacian eigenvalue.
- On graphs with at most three Laplacian eigenvalues greater than or equal to two.
- Largest eigenvalue of a unicyclic mixed graphs
- On graphs with small number of Laplacian eigenvalues greater than two
- The Laplacian eigenvalues of mixed graphs
- The Laplacian Spectrum of a Graph
- Generalized matrix tree theorem for mixed graphs
- On bipartite graphs with small number of laplacian eigenvalues greater than two and three
- Edge version of the matrix tree theorem for trees
- On the least eigenvalue of a unicyclic mixed graph
- A relation between the matching number and Laplacian spectrum of a graph
This page was built for publication: Nonsingular mixed graphs with few eigenvalues greater than two