Maximizing Algebraic Connectivity Over Unicyclic Graphs

DOI10.1080/0308108031000069182MaRDI QIDQ4460635zbMATH OpenOpenAlexFDO

Authors Shaun M. Fallat, S. J. Kirkland, S. Pati

Publication date 18 May 2004

Published in Linear and Multilinear Algebra (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/0308108031000069182

zbMATH Keywords

Laplacian matrixPerron valueunicyclic graph

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Positive matrices and their generalizations; cones of matrices (15B48)

Recommendations

• Maximizing algebraic connectivity for certain families of graphs
• Maximizing Algebraic Connectivity in the Space of Graphs With a Fixed Number of Vertices and Edges
• Extremizing algebraic connectivity subject to graph theoretic constraints
• Maximizing algebraic connectivity for quasi-c-cyclic graphs.
• Maximising the number of connected induced subgraphs of unicyclic graphs
• scientific article; zbMATH DE number 5732677
• The smallest values of algebraic connectivity for unicyclic graphs
• Graphs with given diameter maximizing the algebraic connectivity
• The ordering of unicyclic graphs with the smallest algebraic connectivity
• Algorithms for finding diameter-constrained graphs with maximum algebraic connectivity

Cited in

(19)

• The Laplacian spectral radius of tricyclic graphs with n vertices and k pendant vertices
• First eigenvalue and first eigenvectors of a nonsingular unicyclic mixed graph
• Ordering trees and graphs with few cycles by algebraic connectivity
• First eigenvalue of nonsingular mixed graphs with given number of pendant vertices
• The algebraic connectivity of graphs with given matching number
• Minimizing Laplacian spectral radius of unicyclic graphs with fixed girth.
• Maximizing algebraic connectivity for quasi-c-cyclic graphs.
• scientific article; zbMATH DE number 5732677 (Why is no real title available?)
• Extremizing algebraic connectivity subject to graph theoretic constraints
• On the least eigenvalue of a unicyclic mixed graph
• Finding diverse ways to improve algebraic connectivity through multi-start optimization
• Hamiltonian graphs of given order and minimum algebraic connectivity
• The smallest values of algebraic connectivity for unicyclic graphs
• On ordering bicyclic graphs with respect to the Laplacian spectral radius
• Algebraic connectivity of connected graphs with fixed number of pendant vertices
• The algebraic connectivity of graphs with given induced matching number
• On energy and Laplacian energy of chain graphs
• Old and new results on algebraic connectivity of graphs
• A survey of automated conjectures in spectral graph theory

This page was built for publication: Maximizing Algebraic Connectivity Over Unicyclic Graphs

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