Minimal extremal graphs for addition of algebraic connectivity and independence number of connected graphs

DOI10.2298/FIL1718545CzbMath1499.05356OpenAlexW2795568637MaRDI QIDQ5019804

Muhuo Liu, Kinkar Chandra Das

Publication date: 11 January 2022

Published in: Filomat (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2298/fil1718545c

zbMATH Keywords

independence numberlower boundLaplacian matrixradiusalgebraic connectivity

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40)

Cites Work

• Unnamed Item
• Proof of a problem on Laplacian eigenvalues of trees
• A conjecture on algebraic connectivity of graphs
• The Laplacian spectral radius of trees and maximum vertex degree
• The Laplacian spectrum of a graph
• Proof of conjectures involving algebraic connectivity of graphs
• The six classes of trees with the largest algebraic connectivity

This page was built for publication: Minimal extremal graphs for addition of algebraic connectivity and independence number of connected graphs