Computing the maximal signless Laplacian index among graphs of prescribed order and diameter

DOI10.4067/S0716-09172015000400006zbMath1346.05157OpenAlexW2269857239MaRDI QIDQ2812615

Oscar Rojo, Eber Lenes, Nair Maria Maia De Abreu

Publication date: 17 June 2016

Published in: Proyecciones (Antofagasta) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4067/s0716-09172015000400006

zbMATH Keywords

diametersignless Laplacian indexbug

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)

Cites Work

• Bounds and conjectures for the signless Laplacian index of graphs
• Maximizing signless Laplacian or adjacency spectral radius of graphs subject to fixed connectivity
• Spectra of graphs obtained by a generalization of the join graph operation
• Eigenvalues of a \(H\)-generalized join graph operation constrained by vertex subsets
• A conjecture on the diameter and signless Laplacian index of graphs