A spectral bound for graph irregularity

DOI10.1007/s10587-015-0182-5zbMath1349.05181arXiv1308.3867OpenAlexW2122187529MaRDI QIDQ2947995

Felix Goldberg

Publication date: 29 September 2015

Published in: Czechoslovak Mathematical Journal (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1308.3867

zbMATH Keywords

irregularitydegreeLaplacian matrixLaplacian index

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Vertex degrees (05C07)

Related Items (6)

New results on imbalance graphic graphs ⋮ Some new spectral bounds for graph irregularity ⋮ On the irregularity of \(\pi \)-permutation graphs, Fibonacci cubes, and trees ⋮ Molecular trees with the sixth, seventh and eighth minimal irregularity values ⋮ Lower bounds on the irregularity of trees and unicyclic graphs ⋮ The extremal irregularity of connected graphs with given number of pendant vertices

Cites Work

• On the irregularity of bipartite graphs
• A note on Laplacian graph eigenvalues
• Laplacian matrices of graphs: A survey
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A spectral bound for graph irregularity