A conjecture on the algebraic connectivity of connected graphs with fixed girth

DOI10.1016/J.DISC.2007.10.044MaRDI QIDQ998451zbMATH OpenOpenAlexWikidataFDO

Authors Jiming Guo

Publication date 28 January 2009

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2007.10.044

zbMATH Keywords

Laplacian matrixcharacteristic polynomialunicyclic graphalgebraic connectivityfiedler vector

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Connectivity (05C40)

Recommendations

• Minimizing algebraic connectivity over connected graphs with fixed girth
• Algebraic connectivity of connected graphs with fixed number of pendant vertices
• The ordering of unicyclic graphs with the smallest algebraic connectivity
• Proof of conjectures involving algebraic connectivity of graphs
• 2-connected graphs with the minimum algebraic connectivity

Cites work

• scientific article; zbMATH DE number 3681933 (Why is no real title available?)
• scientific article; zbMATH DE number 4114654 (Why is no real title available?)
• scientific article; zbMATH DE number 3417498 (Why is no real title available?)
• Algebraic connectivity and the characteristic set of a graph
• Algebraic connectivity of weighted trees under perturbation
• Characteristic vertices of trees^*
• Characteristic vertices of weighted trees via perron values
• Eigenvalues of the Laplacian of a graph^∗
• Extremizing algebraic connectivity subject to graph theoretic constraints
• Minimizing algebraic connectivity over connected graphs with fixed girth
• Old and new results on algebraic connectivity of graphs
• On algebraic connectivity and spectral integral variations of graphs
• On the second largest Laplacian eigenvalue of trees
• Ordering trees by algebraic connectivity
• The Laplacian Spectrum of a Graph

Cited in

(25)

• Ordering trees and graphs with few cycles by algebraic connectivity
• Graphs of degree at least \({3}\) with minimum algebraic connectivity
• Minimizing algebraic connectivity over graphs made with some given blocks
• The algebraic connectivity of lollipop graphs
• On limit points of Laplacian spectral radii of graphs
• Algebraic connectivity of connected graphs with fixed number of pendant vertices
• On the uniqueness of some girth eight algebraically defined graphs
• The smallest values of algebraic connectivity for trees
• Signless Laplacian spectral characterization of 4-rose graphs
• Spectral characterizations of signed lollipop graphs
• On the Laplacian, signless Laplacian and normalized Laplacian characteristic polynomials of a graph.
• On algebraic connectivity of graphs with at most two points of articulation in each block
• Conjectures on index and algebraic connectivity of graphs
• The algebraic connectivity of barbell graphs
• Signless Laplacian spectral characterization of line graphs of \(T\)-shape trees
• First eigenvalue of nonsingular mixed graphs with given number of pendant vertices
• The smallest values of algebraic connectivity for unicyclic graphs
• Minimizing algebraic connectivity over connected graphs with fixed girth
• Laplacian spectral characterization of dumbbell graphs and theta graphs
• A lower bound for the algebraic connectivity of a graph in terms of the domination number
• Effects on the algebraic connectivity of weighted graphs under edge rotations
• The ordering of unicyclic graphs with the smallest algebraic connectivity
• Surgery principles for the spectral analysis of quantum graphs
• Laplacian spectral characterization of clover graphs
• The algebraic connectivity of graphs with given circumference

This page was built for publication: A conjecture on the algebraic connectivity of connected graphs with fixed girth

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q998451)