scientific article; zbMATH DE number 4114654
From MaRDI portal
Publication:4729804
zbMATH Open0681.05022MaRDI QIDQ4729804FDOQ4729804
Authors: Russell Merris, Robert D. Grone
Publication date: 1987
Full work available at URL: https://eudml.org/doc/13675
Title of this publication is not available (Why is that?)
Recommendations
- Absolute algebraic connectivity of trees
- Algebraic connectivity and degree sequences of trees
- On trees with maximum algebraic connectivity
- Algebraic connectivity of trees with the maximum degree
- Algebraic connectivity of weighted trees under perturbation
- On connectivities of tree graphs
- The smallest values of algebraic connectivity for trees
- Ordering trees by algebraic connectivity
- Ordering trees by algebraic connectivity
- Connectivity and tree structure in finite graphs
treeseigenvaluespectrumalgebraic connectivitysymmetric partLaplacian matrix of a treealternating part
Cites Work
Cited In (45)
- Characteristic vertices of trees*
- The influence of Miroslav Fiedler on spectral graph theory
- The six classes of trees with the largest algebraic connectivity
- Bounds of Laplacian spectrum of graphs based on the domination number
- Trees with matrix weights: Laplacian matrix and characteristic-like vertices
- Combinatorial Perron parameters for trees
- A tight upper bound on the spectral radius of bottleneck matrices for graphs
- Characteristic vertices of trees*
- On conjectures involving second largest signless Laplacian eigenvalue of graphs
- The effect on the algebraic connectivity of a tree by grafting or collapsing of edges
- Laplacian matrices of graphs: A survey
- On the algebraic connectivity of graphs as a function of genus
- Comparison between Kirchhoff index and the Laplacian-energy-like invariant
- Unicyclic graphs with five Laplacian eigenvalues different from 0 and 1
- A conjecture on the algebraic connectivity of connected graphs with fixed girth
- Lower bounds of the Laplacian spectrum of graphs based on diameter
- Old and new results on algebraic connectivity of graphs
- About the type of broom trees
- On algebraic connectivity and spectral integral variations of graphs
- On singularity and properties of eigenvectors of complex Laplacian matrix of multidigraphs
- Algebraic connectivity of connected graphs with fixed number of pendant vertices
- Some minimax problems for graphs
- Trees with a large Laplacian eigenvalue multiplicity
- On the geometry and Laplacian of a graph
- Extreme values of the Fiedler vector on trees
- The spectral radius of submatrices of Laplacian matrices for graphs with cut vertices
- Title not available (Why is that?)
- The algebraic connectivity of lollipop graphs
- On Laplacian energy of graphs
- Eigenvalues, diameter, and mean distance in graphs
- Ordering trees by algebraic connectivity
- An upper bound on the algebraic connectivity of outerplanar graphs
- Perron value and moment of rooted trees
- 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
- Riordan graphs. II: Spectral properties
- Perron values and classes of trees
- Spectra of graphs resulting from various graph operations and products: a survey
- Constructions for type I trees with nonisomorphic Perron branches
- A survey of automated conjectures in spectral graph theory
- Title not available (Why is that?)
- On Laplacian energy, Laplacian-energy-like invariant and Kirchhoff index of graphs
- On the multiplicity of Laplacian eigenvalues for unicyclic graphs
- Spectral properties of Pascal graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4729804)