Proof of conjectures involving algebraic connectivity of graphs

DOI10.1016/j.laa.2012.11.036zbMath1262.05092WikidataQ123026686 ScholiaQ123026686MaRDI QIDQ1947091

Kinkar Chandra Das

Publication date: 12 April 2013

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2012.11.036

zbMATH Keywords

diameter; minimum degree; algebraic connectivity; largest Laplacian eigenvalue

Mathematics Subject Classification ID

05C35: Extremal problems in graph theory

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

05C12: Distance in graphs

05C40: Connectivity

05C07: Vertex degrees

Related Items

Minimal extremal graphs for addition of algebraic connectivity and independence number of connected graphs, Lower bounds for the algebraic connectivity of graphs with specified subgraphs, Upper bounds on the (signless) Laplacian eigenvalues of graphs, Proof of conjecture involving algebraic connectivity and average degree of graphs, Ordering trees and graphs with few cycles by algebraic connectivity, Proof of conjectures on remoteness and proximity in graphs

Uses Software

• AutoGraphiX

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Proof of conjecture involving the second largest signless Laplacian eigenvalue and the index of graphs
• Conjectures on index and algebraic connectivity of graphs
• Proof of conjectures involving the largest and the smallest signless Laplacian eigenvalues of graphs
• Lower bounds of the Laplacian spectrum of graphs based on diameter
• Variable neighborhood search for extremal graphs. 21. Conjectures and results about the independence number
• A survey of automated conjectures in spectral graph theory
• On conjectures involving second largest signless Laplacian eigenvalue of graphs
• Nordhaus-Gaddum relations for proximity and remoteness in graphs
• The Laplacian spectral radius of some graphs
• Variable neighborhood search for extremal graphs. 23. On the Randić index and the chromatic number
• Eigenvalues, diameter, and mean distance in graphs
• Laplacian matrices of graphs: A survey
• An improved upper bound for Laplacian graph eigenvalues
• A characterization on graphs which achieve the upper bound for the largest Laplacian eigenvalue of graphs.
• An always nontrivial upper bound for Laplacian graph eigenvalues
• Proof of conjectures on adjacency eigenvalues of graphs
• Characterization on graphs which achieve a Das' upper bound for Laplacian spectral radius
• Variable neighborhood search for extremal graphs. I: The AutoGraphiX system
• On the conjecture for certain Laplacian integral spectrum of graphs
• Eigenvalues of the Laplacian of a graph^∗