Maximizing signless Laplacian or adjacency spectral radius of graphs subject to fixed connectivity

DOI10.1016/j.laa.2010.04.045zbMath1207.05125MaRDI QIDQ989058

Yi-Zheng Fan, Hai-Feng Wang, Miao-Lin Ye

Publication date: 27 August 2010

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2010.04.045

zbMATH Keywords

graph; spectral radius; adjacency matrix; connectivity; signless Laplacian matrix

Mathematics Subject Classification ID

90C27: Combinatorial optimization

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

05C40: Connectivity

Related Items

Bipartiteness and the least eigenvalue of signless Laplacian of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• The Laplacian spectrum of a mixed graph
• On a signless Laplacian spectral characterization of \(T\)-shape trees
• Signless Laplacians of finite graphs
• Unoriented Laplacian maximizing graphs are degree maximal
• Q-integral graphs with edge-degrees at most five
• A sharp lower bound for the least eigenvalue of the signless Laplacian of a non-bipartite graph
• Towards a spectral theory of graphs based on the signless Laplacian. II.
• A survey of automated conjectures in spectral graph theory
• Bounds on the \(Q\)-spread of a graph
• Infinite families of \(Q\)-integral graphs
• The signless Laplacian spectral radius of graphs with given degree sequences
• Bounds on the index of the signless Laplacian of a graph
• On some forests determined by their Laplacian or signless Laplacian spectrum
• The least eigenvalue of graphs with given connectivity
• On the maximal signless Laplacian spectral radius of graphs with given matching number
• On graphs whose signless Laplacian index does not exceed 4.5
• First eigenvalue and first eigenvectors of a nonsingular unicyclic mixed graph
• The signless Laplacian spectral radius of graphs with given number of pendant vertices
• On the spectral radius of graphs with cut vertices
• On the spectral radius of graphs with cut edges
• Nonsingular mixed graphs with few eigenvalues greater than two
• Maximizing spectral radius of unoriented Laplacian matrix over bicyclic graphs of a given order
• The maximum clique and the signless Laplacian eigenvalues
• Towards a spectral theory of graphs based on the signless Laplacian, I
• On three conjectures involving the signless Laplacian spectral radius of graphs
• Generalized matrix tree theorem for mixed graphs
• THE MAXIMUM CONNECTIVITY OF A GRAPH