Algebraic connectivity and the characteristic set of a graph

DOI10.1080/03081089808818590MaRDI QIDQ4942589zbMATH OpenOpenAlexFDO

Authors R. B. Bapat, S. 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

Laplacian matrixeigenvalueeigenvectorMoore-Penrose inverseincidence matrixalgebraic connectivitycharactristic set

Mathematics Subject Classification ID

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

Recommendations

• Trees with matrix weights: Laplacian matrix and characteristic-like vertices
• Perron components and algebraic connectivity for weighted graphs
• Characteristic vertices of trees^*
• Characteristic vertices of trees^*
• On algebraic connectivity and spectral integral variations of graphs

Cites work

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

Cited in

(32)

• Algebraic connectivity and degree sequences of trees
• Invertibility of graph translation and support of Laplacian Fiedler vectors
• The ordering of trees and connected graphs by algebraic connectivity
• The property of maximal eigenvectors of trees
• On edge singularity and eigenvectors of mixed graphs
• On the Fiedler vectors of graphs that arise from trees by Schur complementation of the Laplacian
• The effect on the algebraic connectivity of a tree by grafting or collapsing of edges
• Different central parts of trees and their pairwise distances
• First eigenvalue and first eigenvectors of a nonsingular unicyclic mixed graph
• A conjecture on the algebraic connectivity of connected graphs with fixed girth
• On trees with exactly one characteristic element
• The perturbed laplacian matrix of a graph
• On algebraic connectivity and spectral integral variations of graphs
• Maximizing the distance between center, centroid and characteristic set of a tree
• A lower bound for the algebraic connectivity of a graph in terms of the domination number
• On singularity and properties of eigenvectors of complex Laplacian matrix of multidigraphs
• Algebraic connectivity of connected graphs with fixed number of pendant vertices
• The effect on the second smallest eigenvalue of the normalized Laplacian of a graph by grafting edges
• Algebraic connectivity on a subclass of caterpillars
• The algebraic connectivity of lollipop graphs
• Ordering trees with nearly perfect matchings by algebraic connectivity
• The algebraic connectivity of graphs under perturbation
• Algebraic connectivity of \(k\)-connected graphs.
• Minimizing algebraic connectivity over graphs made with some given blocks
• Connectivity of some algebraically defined digraphs
• Hamiltonian graphs of given order and minimum algebraic connectivity
• Algebraic connectivity and disjoint vertex subsets of graphs
• Algebraic connectivity for subclasses of caterpillars
• The algebraic connectivity of graphs with given matching number
• On eigenvectors of mixed graphs with exactly one nonsingular cycle
• Laplace spectra of orgraphs and their applications
• Spectral integral variation and unicyclic 3-colored digraphs with second smallest eigenvalue 1

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

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