Maximizing the signless Laplacian spectral radius of \(k\)-connected graphs with given diameter

DOI10.1016/j.laa.2021.01.015zbMath1459.05175OpenAlexW3126842318MaRDI QIDQ2656640

Yanyan Li

Publication date: 16 March 2021

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

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

zbMATH Keywords

diametersignless Laplacian matrixsignless Laplacian spectral radius\(k\)-connected graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12) Connectivity (05C40)

Related Items

Maximizing the \(A_\alpha \)-spectral radius of graphs with given size and diameter ⋮ Sharp upper bounds on the \(Q\)-index of (minimally) 2-connected graphs with given size ⋮ On the (signless Laplacian) spectral radius of minimally \(k\)-(edge)-connected graphs for small \(k\) ⋮ Ordering graphs with given size by their signless Laplacian spectral radii

Cites Work

• Unnamed Item
• Signless Laplacians of finite graphs
• Maximizing the spectral radius of \(k\)-connected graphs with given diameter
• Graphs with given diameter maximizing the spectral radius
• Maximizing the Laplacian spectral radii of graphs with given diameter
• On the \(A_\alpha\)-spectral radius of a graph
• The minimum spectral radius of signless Laplacian of graphs with a given clique number
• The Laplacian spectral radius of some bipartite graphs
• On bags and bugs
• Sharp upper and lower bounds for largest eigenvalue of the Laplacian matrices of trees
• Maximizing the signless Laplacian spectral radius of graphs with given diameter or cut vertices
• On the Spectral Radius of Complementary Acyclic Matrices of Zeros and Ones
• Merging the A-and Q-spectral theories
• Diameters in graphs