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

DOI10.4067/S0716-09172015000400006zbMATH Open1346.05157OpenAlexW2269857239MaRDI QIDQ2812615FDOQ2812615

Oscar Rojo, Nair Abreu, Eber Lenes

Publication date: 17 June 2016

Published in: Proyecciones (Search for Journal in Brave)

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

Recommendations

• A conjecture on the diameter and signless Laplacian index of graphs
• The signless Laplacian spectral radius of graphs with given diameter
• Maximizing the signless Laplacian spectral radius of graphs with given diameter or cut vertices
• Graphs with maximal signless Laplacian spectral radius
• On bags and bugs

zbMATH Keywords

diametersignless Laplacian indexbug

Mathematics Subject Classification ID

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

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

This page was built for publication: Computing the maximal signless Laplacian index among graphs of prescribed order and diameter

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