Algebraic connectivity on a subclass of caterpillars
From MaRDI portal
Publication:2840700
DOI10.1016/J.ENDM.2011.05.027zbMATH Open1268.05126OpenAlexW2018442394MaRDI QIDQ2840700FDOQ2840700
Authors: Oscar Rojo, Israel Rocha, Vilmar Trevisan
Publication date: 23 July 2013
Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.endm.2011.05.027
Recommendations
- Algebraic connectivity for subclasses of caterpillars
- Maximizing the algebraic connectivity for a subclass of caterpillars
- On the algebraic connectivity of some caterpillars: a sharp upper bound and a total ordering
- Extremal algebraic connectivities of certain caterpillar classes and symmetric caterpillars
- ALGEBRAIC CONNECTIVITY
- The minimum algebraic connectivity of caterpillar unicyclic graphs
- The algebraic connectivity of graphs under perturbation
- A conjecture on algebraic connectivity of graphs
- On the algebraic connectivity of bicyclic graphs
- Algebraic connectivity and the characteristic set of a graph
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Extremizing algebraic connectivity subject to graph theoretic constraints
- Old and new results on algebraic connectivity of graphs
- The ordering of trees and connected graphs by algebraic connectivity
- Eigenvalues and eigenvectors of tridiagonal matrices
- On the algebraic connectivity of some caterpillars: a sharp upper bound and a total ordering
- Characteristic vertices of weighted trees via perron values
- Ordering trees by algebraic connectivity
- Ordering trees with nearly perfect matchings by algebraic connectivity
- Ordering trees with algebraic connectivity and diameter
- The six classes of trees with the largest algebraic connectivity
- Extremal algebraic connectivities of certain caterpillar classes and symmetric caterpillars
Cited In (8)
- Algebraic connectivity and degree sequences of trees
- A connectivity lemma for the Albanese map
- On the algebraic connectivity of some caterpillars: a sharp upper bound and a total ordering
- On trees with algebraic connectivity greater than or equal to \(2(1-\cos(\frac{\pi}{7}))\)
- Maximizing the algebraic connectivity for a subclass of caterpillars
- Extremal algebraic connectivities of certain caterpillar classes and symmetric caterpillars
- Ordering trees and graphs with few cycles by algebraic connectivity
- Algebraic connectivity for subclasses of caterpillars
This page was built for publication: Algebraic connectivity on a subclass of caterpillars
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2840700)