Maximizing the algebraic connectivity for a subclass of caterpillars

DOI10.1016/j.endm.2009.11.012zbMath1268.05120OpenAlexW1992366592MaRDI QIDQ2840516

No author found.

Publication date: 19 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.2009.11.012

zbMATH Keywords

treepathcaterpillarstar

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Connectivity (05C40)

Related Items (1)

Ordering trees and graphs with few cycles by algebraic connectivity

Cites Work

• Unnamed Item
• Old and new results on algebraic connectivity of graphs
• Spectra of generalized Bethe trees attached to a path
• Laplacian matrices of graphs: A survey
• Characteristic vertices of weighted trees via perron values
• Extremizing algebraic connectivity subject to graph theoretic constraints
• Ordering trees by algebraic connectivity

This page was built for publication: Maximizing the algebraic connectivity for a subclass of caterpillars