On the algebraic connectivity of graphs as a function of genus

DOI10.1016/j.laa.2006.05.014zbMath1109.05072OpenAlexW2036092847MaRDI QIDQ865413

Jason J. Molitierno

Publication date: 14 February 2007

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

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

zbMATH Keywords

Laplacian matrix

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (8)

An upper bound on the algebraic connectivity of outerplanar graphs ⋮ Old and new results on algebraic connectivity of graphs ⋮ On the Fiedler value of large planar graphs ⋮ On edge-rupture degree of graphs ⋮ A survey of automated conjectures in spectral graph theory ⋮ Unnamed Item ⋮ Perron value and moment of rooted trees ⋮ Circulant graphs and tessellations on flat tori

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Laplacian matrices of graphs: A survey
• Das Geschlecht des vollständigen dreifärbbaren Graphen
• Isoperimetric numbers of graphs
• On graphs with equal algebraic and vertex connectivity

This page was built for publication: On the algebraic connectivity of graphs as a function of genus