On two conjectures of spectral graph theory

DOI10.1007/s41980-018-0003-3zbMath1409.05128OpenAlexW2791488691WikidataQ123336326 ScholiaQ123336326MaRDI QIDQ1734009

Muhuo Liu, Kinkar Chandra Das

Publication date: 22 March 2019

Published in: Bulletin of the Iranian Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s41980-018-0003-3

zbMATH Keywords

graphspectral radiusalgebraic connectivitysignless Laplacian spectral radius

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Matrices of integers (15B36)

Uses Software

• SageMath

Cites Work

• Unnamed Item
• Unnamed Item
• Upper bounds on the (signless) Laplacian eigenvalues of graphs
• On the Laplacian spread of graphs
• A survey of automated conjectures in spectral graph theory
• Laplacian matrices of graphs: A survey
• Bounds on the greatest eigenvalue of graphs.
• The smallest values of algebraic connectivity for trees
• On a conjecture for the signless Laplacian eigenvalues
• The six classes of trees with the largest algebraic connectivity
• The ordering of trees and connected graphs by algebraic connectivity
• Eigenvalue bounds for the signless laplacian
• The Signless Laplacian Spectral Radius for Bicyclic Graphs with κ Pendant Vertices

This page was built for publication: On two conjectures of spectral graph theory