Algebraic connectivity and the characteristic set of a graph

DOI10.1080/03081089808818590zbMATH Open0944.05066OpenAlexW2051081806MaRDI QIDQ4942589FDOQ4942589

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

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

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)

Cites Work

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

Cited In (32)

• Invertibility of graph translation and support of Laplacian Fiedler vectors
• Algebraic connectivity and degree sequences of trees
• 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
• On singularity and properties of eigenvectors of complex Laplacian matrix of multidigraphs
• 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
• The effect on the second smallest eigenvalue of the normalized Laplacian of a graph by grafting edges
• Algebraic connectivity of connected graphs with fixed number of pendant vertices
• Algebraic connectivity on a subclass of caterpillars
• The algebraic connectivity of lollipop graphs
• Algebraic connectivity of \(k\)-connected graphs.
• Ordering trees with nearly perfect matchings by algebraic connectivity
• The algebraic connectivity of graphs under perturbation
• Minimizing algebraic connectivity over graphs made with some given blocks
• Hamiltonian graphs of given order and minimum algebraic connectivity
• Connectivity of some algebraically defined digraphs
• 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)