The algebraic connectivity of graphs under perturbation

DOI10.1016/J.LAA.2010.04.046MaRDI QIDQ989054zbMATH OpenOpenAlexFDO

Authors Jiming Guo

Publication date 27 August 2010

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

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

zbMATH Keywords

Laplacian matrixalgebraic connectivityfiedler vector

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) Determinants, permanents, traces, other special matrix functions (15A15)

Cites work

• scientific article; zbMATH DE number 3681933 (Why is no real title available?)
• scientific article; zbMATH DE number 4114654 (Why is no real title available?)
• scientific article; zbMATH DE number 3417498 (Why is no real title available?)
• A bound on the algebraic connectivity of a graph in terms of the number of cutpoints
• Algebraic connectivity and the characteristic set of a graph
• Algebraic connectivity of weighted trees under perturbation
• Characteristic vertices of trees^*
• Characteristic vertices of weighted trees via perron values
• Extremizing algebraic connectivity subject to graph theoretic constraints
• Laplacian graph eigenvectors
• Matrix Analysis
• Minimizing algebraic connectivity over connected graphs with fixed girth
• Old and new results on algebraic connectivity of graphs
• On algebraic connectivity and spectral integral variations of graphs
• Ordering trees by algebraic connectivity
• The effect on the algebraic connectivity of a tree by grafting or collapsing of edges

Cited in

(17)

• On a poset of trees. II
• The ordering of trees and connected graphs by algebraic connectivity
• ON THE ALGEBRAIC EMBEDDABILITY IN THE CLASS OF FUNCTIONS POSSESSING CONNECTED GRAPHS
• An edge-separating theorem on the second smallest normalized Laplacian eigenvalue of a graph and its applications
• Old and new results on algebraic connectivity of graphs
• Which cospectral graphs have same degree sequences
• A lower bound for the algebraic connectivity of a graph in terms of the domination number
• On the relationship between shortlex order and \(A_\alpha \)-spectral radii of graphs with starlike branch tree
• Algebraic connectivity on a subclass of caterpillars
• Effects on the algebraic connectivity of weighted graphs under edge rotations
• The algebraic connectivity of lollipop graphs
• Conjectures on index and algebraic connectivity of graphs
• Ordering trees by algebraic connectivity
• The smallest values of algebraic connectivity for trees
• Ordering trees and graphs with few cycles by algebraic connectivity
• Algebraic connectivity and disjoint vertex subsets of graphs
• Algebraic connectivity for subclasses of caterpillars

This page was built for publication: The algebraic connectivity of graphs under perturbation

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