Extremizing algebraic connectivity subject to graph theoretic constraints
From MaRDI portal
Publication:4391459
DOI10.13001/1081-3810.1014zbMath0913.05073OpenAlexW1602384651MaRDI QIDQ4391459
Shaun M. Fallat, Stephen J. Kirkland
Publication date: 3 June 1998
Published in: The Electronic Journal of Linear Algebra (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/119759
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Positive matrices and their generalizations; cones of matrices (15B48)
Related Items (43)
A lower bound for the algebraic connectivity of a graph in terms of the domination number ⋮ Extremizing first eigenvalue of 3-colored digraphs made with given blocks ⋮ Augmenting the algebraic connectivity for certain families of graphs ⋮ The algebraic connectivity of graphs with given circumference ⋮ New conjectures on algebraic connectivity and the Laplacian spread of graphs ⋮ Upper bounds on algebraic connectivity via convex optimization ⋮ On the Laplacian spectral radius of trees with fixed diameter ⋮ Old and new results on algebraic connectivity of graphs ⋮ The smallest values of algebraic connectivity for unicyclic graphs ⋮ The influence of Miroslav Fiedler on spectral graph theory ⋮ On the distance Laplacian spectra of graphs ⋮ Graphs of given order and size and minimum algebraic connectivity ⋮ About the type of broom trees ⋮ The algebraic connectivity of lollipop graphs ⋮ Absolute algebraic connectivity of double brooms and trees ⋮ A note on limit points for algebraic connectivity ⋮ A Family of Diameter-Based Eigenvalue Bounds for Quantum Graphs ⋮ Ordering trees by algebraic connectivity ⋮ Algebraic connectivity of connected graphs with fixed number of pendant vertices ⋮ Minimizing algebraic connectivity over graphs made with some given blocks ⋮ Ordering trees with algebraic connectivity and diameter ⋮ Entries of the group inverse of the Laplacian matrix for generalized Johnson graphs ⋮ Ordering trees and graphs with few cycles by algebraic connectivity ⋮ Algebraic connectivity and degree sequences of trees ⋮ A survey of automated conjectures in spectral graph theory ⋮ A tight upper bound on the spectral radius of bottleneck matrices for graphs ⋮ On the sum of the two largest Laplacian eigenvalues of trees ⋮ Maximizing algebraic connectivity for certain families of graphs ⋮ The algebraic connectivity of graphs under perturbation ⋮ A conjecture on the algebraic connectivity of connected graphs with fixed girth ⋮ On the Fiedler vectors of graphs that arise from trees by Schur complementation of the Laplacian ⋮ The maximum relaxation time of a random walk ⋮ Hamiltonian graphs of given order and minimum algebraic connectivity ⋮ Some results on the Laplacian eigenvalues of unicyclic graphs ⋮ First eigenvalue and first eigenvectors of a nonsingular unicyclic mixed graph ⋮ Perron value and moment of rooted trees ⋮ Surgery principles for the spectral analysis of quantum graphs ⋮ Perron values and classes of trees ⋮ Maximizing the algebraic connectivity for a subclass of caterpillars ⋮ Algebraic connectivity on a subclass of caterpillars ⋮ The ordering of unicyclic graphs with the smallest algebraic connectivity ⋮ On the algebraic connectivity of some caterpillars: a sharp upper bound and a total ordering ⋮ Efficient rewirings for enhancing synchronizability of dynamical networks
This page was built for publication: Extremizing algebraic connectivity subject to graph theoretic constraints
