On the lower bound of the sum of the algebraic connectivity of a graph and its complement

DOI10.1016/j.jctb.2021.06.007zbMath1479.05200OpenAlexW3176414553MaRDI QIDQ1984518

Mohammad Mahdi Karkhaneei, Mostafa Einollahzadeh

Publication date: 16 September 2021

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jctb.2021.06.007

zbMATH Keywords

Laplacian spreadeffective resistanceLaplacian eigenvalues of graphsNordhaus-Gaddum type inequalities

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Connectivity (05C40)

Related Items (7)

New conjectures on algebraic connectivity and the Laplacian spread of graphs ⋮ Algebraic connectivity of the second power of a graph ⋮ On the Laplacian spread of digraphs ⋮ Graph Limits and Spectral Extremal Problems for Graphs ⋮ Nordhaus-Gaddum type inequalities for the \(k\)th largest Laplacian eigenvalues ⋮ On the Ky Fan $k$-norm of the $LI$-matrix of graphs ⋮ The Laplacian spread of line graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some results on the Laplacian spread of a graph
• Nordhaus-Gaddum type inequalities for Laplacian and signless Laplacian eigenvalues
• Effective graph resistance
• On the Laplacian spread of graphs
• The Laplacian spread of unicyclic graphs
• The algebraic connectivity of a graph and its complement
• The Laplacian spread of tricyclic graphs
• The Laplacian spread of quasi-tree graphs
• The Laplacian spread of graphs

This page was built for publication: On the lower bound of the sum of the algebraic connectivity of a graph and its complement