Nonsingular mixed graphs with few eigenvalues greater than two

DOI10.1016/J.EJC.2006.07.004MaRDI QIDQ2372430zbMATH OpenOpenAlexFDO

Authors Shi-Cai Gong, Jun Zhou, Ying-Ying Tan, Yi Wang, Yizheng 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

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Recommendations

• Nonsingular unicyclic mixed graphs with at most three eigenvalues greater than two
• First eigenvalue of nonsingular mixed graphs with given number of pendant vertices
• First eigenvalue of nonsingular mixed unicyclic graphs with fixed number of branch vertices
• On eigenvectors of mixed graphs with exactly one nonsingular cycle
• The Laplacian eigenvalues of mixed graphs

Cites work

• A relation between the matching number and Laplacian spectrum of a graph
• Bipartite graphs with small third Laplacian eigenvalue.
• Edge version of the matrix tree theorem for trees
• Generalized matrix tree theorem for mixed graphs
• Graphs with fourth Laplacian eigenvalue less than two
• scientific article; zbMATH DE number 3681933 (Why is no real title available?)
• scientific article; zbMATH DE number 1054729 (Why is no real title available?)
• scientific article; zbMATH DE number 3417498 (Why is no real title available?)
• Laplacian matrices of graphs: A survey
• Largest eigenvalue of a unicyclic mixed graphs
• On bipartite graphs with small number of laplacian eigenvalues greater than two and three
• On graphs with at most three Laplacian eigenvalues greater than or equal to two.
• On graphs with small number of Laplacian eigenvalues greater than two
• On spectral integral variations of mixed graphs
• On the least eigenvalue of a unicyclic mixed graph
• The Laplacian eigenvalues of mixed graphs
• The Laplacian Spectrum of a Graph
• The Laplacian spectrum of a mixed graph

Cited in

(16)

• On spectral integral variations of mixed graphs
• The Laplacian eigenvalues of mixed graphs
• Mixed graphs with smallest eigenvalue greater than \(- \sqrt{3}\)
• Mixed graphs with smallest eigenvalue greater than \(- \frac{ \sqrt{ 5} + 1}{ 2} \)
• Vertex-connectivity, chromatic number, domination number, maximum degree and Laplacian eigenvalue distribution
• Spectral characterization of mixed extensions of small graphs
• First eigenvalue of nonsingular mixed graphs with given number of pendant vertices
• Line star sets for Laplacian eigenvalues
• Signless Laplacian eigenvalues and circumference of graphs
• On eigenvalues distribution of mixed graphs
• The perturbation of nonsingular unicyclic mixed graphs
• Nonsingular unicyclic mixed graphs with at most three eigenvalues greater than two
• On the distribution of Laplacian eigenvalues of a graph
• The Laplacian spectrum of a mixed graph
• On edge singularity and eigenvectors of mixed graphs
• Maximizing signless Laplacian or adjacency spectral radius of graphs subject to fixed connectivity

This page was built for publication: Nonsingular mixed graphs with few eigenvalues greater than two

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2372430)