A conjecture on the algebraic connectivity of connected graphs with fixed girth
From MaRDI portal
Publication:998451
DOI10.1016/J.DISC.2007.10.044zbMATH Open1189.05085OpenAlexW2050126923WikidataQ123115020 ScholiaQ123115020MaRDI QIDQ998451FDOQ998451
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
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
- Eigenvalues of the Laplacian of a graph∗
- Title not available (Why is that?)
- On the second largest Laplacian eigenvalue of trees
- The Laplacian Spectrum of a Graph
- Minimizing algebraic connectivity over connected graphs with fixed girth
- Title not available (Why is that?)
- Extremizing algebraic connectivity subject to graph theoretic constraints
- Old and new results on algebraic connectivity of graphs
- Title not available (Why is that?)
- Algebraic connectivity and the characteristic set of a graph
- Characteristic vertices of trees*
- On algebraic connectivity and spectral integral variations of graphs
- Characteristic vertices of weighted trees via perron values
- Algebraic connectivity of weighted trees under perturbation
- Ordering trees by algebraic connectivity
Cited In (24)
- Laplacian spectral characterization of clover graphs
- Laplacian spectral characterization of dumbbell graphs and theta graphs
- On the Laplacian, signless Laplacian and normalized Laplacian characteristic polynomials of a graph.
- The algebraic connectivity of graphs with given circumference
- On the uniqueness of some girth eight algebraically defined graphs
- Signless Laplacian spectral characterization of line graphs of \(T\)-shape trees
- Minimizing algebraic connectivity over connected graphs with fixed girth
- A lower bound for the algebraic connectivity of a graph in terms of the domination number
- Spectral characterizations of signed lollipop graphs
- Algebraic connectivity of connected graphs with fixed number of pendant vertices
- Signless Laplacian spectral characterization of 4-rose graphs
- The ordering of unicyclic graphs with the smallest algebraic connectivity
- The smallest values of algebraic connectivity for unicyclic graphs
- Effects on the algebraic connectivity of weighted graphs under edge rotations
- The algebraic connectivity of lollipop graphs
- Surgery principles for the spectral analysis of quantum graphs
- Conjectures on index and algebraic connectivity of graphs
- First eigenvalue of nonsingular mixed graphs with given number of pendant vertices
- The smallest values of algebraic connectivity for trees
- Minimizing algebraic connectivity over graphs made with some given blocks
- On limit points of Laplacian spectral radii of graphs
- On algebraic connectivity of graphs with at most two points of articulation in each block
- Ordering trees and graphs with few cycles by algebraic connectivity
- The algebraic connectivity of barbell graphs
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)