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