Algebraic connectivity and the characteristic set of a graph

DOI10.1080/03081089808818590zbMath0944.05066OpenAlexW2051081806MaRDI QIDQ4942589

Ravindra B. Bapat, Sukanta Pati

Publication date: 24 September 2000

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

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

zbMATH Keywords

eigenvalueincidence matrixeigenvectorMoore-Penrose inverseLaplacian matrixalgebraic connectivitycharactristic set

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)

Related Items (27)

A lower bound for the algebraic connectivity of a graph in terms of the domination number ⋮ Different central parts of trees and their pairwise distances ⋮ On trees with exactly one characteristic element ⋮ Spectral integral variation and unicyclic 3-colored digraphs with second smallest eigenvalue 1 ⋮ On singularity and properties of eigenvectors of complex Laplacian matrix of multidigraphs ⋮ The algebraic connectivity of lollipop graphs ⋮ The effect on the second smallest eigenvalue of the normalized Laplacian of a graph by grafting edges ⋮ Ordering trees with nearly perfect matchings by algebraic connectivity ⋮ On edge singularity and eigenvectors of mixed graphs ⋮ Algebraic connectivity of connected graphs with fixed number of pendant vertices ⋮ Minimizing algebraic connectivity over graphs made with some given blocks ⋮ The effect on the algebraic connectivity of a tree by grafting or collapsing of edges ⋮ The ordering of trees and connected graphs by algebraic connectivity ⋮ Algebraic connectivity and degree sequences of trees ⋮ The perturbed laplacian matrix of a graph ⋮ Laplace spectra of orgraphs and their applications ⋮ On algebraic connectivity and spectral integral variations of graphs ⋮ The property of maximal eigenvectors of trees ⋮ The algebraic connectivity of graphs under perturbation ⋮ Invertibility of graph translation and support of Laplacian Fiedler vectors ⋮ 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 ⋮ Hamiltonian graphs of given order and minimum algebraic connectivity ⋮ On eigenvectors of mixed graphs with exactly one nonsingular cycle ⋮ First eigenvalue and first eigenvectors of a nonsingular unicyclic mixed graph ⋮ Algebraic connectivity of k-connected graphs ⋮ Maximizing the distance between center, centroid and characteristic set of a tree

Cites Work

• Unnamed Item
• Laplacian matrices of graphs: A survey
• Characteristic vertices of weighted trees via perron values
• The Laplacian Spectrum of a Graph
• Moore-penrose inverse of the incidence matrix of a tree
• Distances in Weighted Trees and Group Inverse of Laplacian Matrices
• Moore-penrose involutions in the classes of laplacians and simplices

This page was built for publication: Algebraic connectivity and the characteristic set of a graph