Old and new results on algebraic connectivity of graphs
From MaRDI portal
Publication:876302
Recommendations
- Some new lower bounds on the algebraic connectivity of graphs
- A conjecture on algebraic connectivity of graphs
- On the \(d\)-dimensional algebraic connectivity of graphs
- Bounds on the algebraic connectivity of graphs
- A Note on an Old-Fashioned Algebra for (Disconnected) Graphs
- scientific article; zbMATH DE number 7473309
- New conjectures on algebraic connectivity and the Laplacian spread of graphs
- On Vertex Connectivity and Absolute Algebraic Connectivity for Graphs
- The algebraic connectivity of graphs under perturbation
- scientific article; zbMATH DE number 1135782
Cites work
- scientific article; zbMATH DE number 1600999 (Why is no real title available?)
- scientific article; zbMATH DE number 4063128 (Why is no real title available?)
- scientific article; zbMATH DE number 3717357 (Why is no real title available?)
- scientific article; zbMATH DE number 3465473 (Why is no real title available?)
- scientific article; zbMATH DE number 3627232 (Why is no real title available?)
- scientific article; zbMATH DE number 1025912 (Why is no real title available?)
- scientific article; zbMATH DE number 2170331 (Why is no real title available?)
- scientific article; zbMATH DE number 4114654 (Why is no real title available?)
- scientific article; zbMATH DE number 3793772 (Why is no real title available?)
- scientific article; zbMATH DE number 4193718 (Why is no real title available?)
- scientific article; zbMATH DE number 3337135 (Why is no real title available?)
- scientific article; zbMATH DE number 3417498 (Why is no real title available?)
- scientific article; zbMATH DE number 2246587 (Why is no real title available?)
- A bound on the algebraic connectivity of a graph in terms of the number of cutpoints
- A note on limit points for algebraic connectivity
- A survey of graph laplacians
- Absolute algebraic connectivity of trees
- Algebraic connectivity of weighted trees under perturbation
- An Upper Bound on the Diameter of a Graph from Eigenvalues Associated with Its Laplacian
- An upper bound on algebraic connectivity of graphs with many cutpoints
- Characteristic vertices of trees*
- Completion of Laplacian integral graphs via edge addition
- Degree maximal graphs are Laplacian integral
- Eigenspaces of graphs
- Eigenvalues and expanders
- Eigenvalues, diameter, and mean distance in graphs
- Eigenvectors of acyclic matrices
- Extremizing algebraic connectivity subject to graph theoretic constraints
- Handbook of Graph Theory
- Isomorph-Free Exhaustive Generation
- Laplace eigenvalues of graphs---a survey
- Laplacian graph eigenvectors
- Laplacian integral graphs in \(S(a, b)\)
- Laplacian matrices of graphs: A survey
- Lower bounds for the eigenvalues of Laplacian matrices
- Maximizing Algebraic Connectivity Over Unicyclic Graphs
- Minimizing algebraic connectivity over connected graphs with fixed girth
- On Vertex Connectivity and Absolute Algebraic Connectivity for Graphs
- On a bound on algebraic connectivity: the case of equality
- On algebraic connectivity and spectral integral variations of graphs
- On graphs with algebraic connectivity equal to minimum edge density
- On graphs with equal algebraic and vertex connectivity
- On the algebraic connectivity of graphs as a function of genus
- On the two conjectures of Graffiti
- Open problems of Paul Erd�s in graph theory
- Optimal linear labelings and eigenvalues of graphs
- Ordering trees by algebraic connectivity
- Parallel concepts in graph theory
- Parameters of connectivity in ()-linear graphs
- Recent results in the theory of graph spectra
- Some minimax problems for graphs
- The Laplacian Spectrum of a Graph
- The asymptotic behaviour of Fiedler's algebraic connectivity for random graphs
- The limit points of Laplacian spectra of graphs
- Tight bounds on the algebraic connectivity of Bethe trees
- Tight bounds on the algebraic connectivity of a balanced binary tree
- Transportation in graphs and the admittance spectrum
- Upper bounds on algebraic connectivity via convex optimization
- Variable neighborhood search for extremal graphs. I: The AutoGraphiX system
- Variable neighborhood search for extremal graphs. V: Three ways to automate finding conjectures
- \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
Cited in
(only showing first 100 items - show all)- Ordering trees and graphs with few cycles by algebraic connectivity
- Algebraic connectivity and doubly stochastic tree matrices
- Augmenting the algebraic connectivity for certain families of graphs
- Upper bounds on algebraic connectivity via convex optimization
- A sharp upper bound on algebraic connectivity using domination number
- Graphs with least eigenvalue \(-2\): ten years on
- The asymptotic behaviour of Fiedler's algebraic connectivity for random graphs
- On the maximal error of spectral approximation of graph bisection
- Computing tight upper bounds on the algebraic connectivity of certain graphs
- Cooperative control with distributed gain adaptation and connectivity estimation for directed networks
- On (distance) signless Laplacian spectra of graphs
- Graph clustering
- Ordering trees by the Laplacian coefficients
- On algebraic connectivity and spectral integral variations of graphs
- Generating new test instances by evolving in instance space
- Synchronization in large-scale nonlinear network systems with uncertain links
- Further results on permanental bounds for the Laplacian matrix of trees
- Comparison between Laplacian-energy-like invariant and Kirchhoff index
- Maxima of the Laplacian spectral radius of (minimally) 2-connected graphs with fixed size
- On algebraic connectivity augmentation
- Some new lower bounds on the algebraic connectivity of graphs
- scientific article; zbMATH DE number 2075777 (Why is no real title available?)
- Absolute algebraic connectivity of double brooms and trees
- Ordering trees with algebraic connectivity and diameter
- Algebraic connectivity of \(k\)-connected graphs.
- Some graphs determined by their (signless) Laplacian spectra
- The Laplacian spectral radius of tricyclic graphs with \(n\) vertices and \(k\) pendant vertices
- New conjectures on algebraic connectivity and the Laplacian spread of graphs
- Applications of combinatorial matrix theory to Laplacian matrices of graphs
- A note on limit points for algebraic connectivity
- Diameters, distortion, and eigenvalues
- Characterizing trees with large Laplacian energy
- A conjecture on the algebraic connectivity of connected graphs with fixed girth
- Consensus and synchronization problems on small-world networks
- Lower bounds for the algebraic connectivity of graphs with specified subgraphs
- Eigenvalues and edge-connectivity of regular graphs
- On the algebraic connectivity of some caterpillars: a sharp upper bound and a total ordering
- The influence of Miroslav Fiedler on spectral graph theory
- Some results on the Laplacian spectrum
- The algebraic connectivity of graphs with given matching number
- Graphs with given diameter maximizing the algebraic connectivity
- On the Fiedler vectors of graphs that arise from trees by Schur complementation of the Laplacian
- Network synchronizability analysis: a graph-theoretic approach
- \texttt{PQser:} a Matlab package for spectral seriation
- Graphs of given order and size and minimum algebraic connectivity
- The algebraic connectivity of graphs under perturbation
- A Note on an Old-Fashioned Algebra for (Disconnected) Graphs
- Controllability-Gramian submatrices for a network consensus model
- A survey of automated conjectures in spectral graph theory
- Laplacian matrices of general complex weighted directed graphs
- Node-to-node pinning control of complex networks
- Analytical characterizations of some classes of optimal strongly attack-tolerant networks and their Laplacian spectra
- On the Fiedler value of large planar graphs
- On Laplacian spectra of parametric families of closely connected networks with application to cooperative control
- On ordering bicyclic graphs with respect to the Laplacian spectral radius
- On distance Laplacian spectral determination of complete multipartite graphs
- Algebraic connectivity and degree sequences of trees
- The Group Inverse of the Laplacian Matrix of a Graph
- On Laplacian spectrum of power graphs of finite cyclic and dihedral groups
- A lower bound for the algebraic connectivity of a graph in terms of the domination number
- Algebraic connectivity for vertex-deleted subgraphs, and a notion of vertex centrality
- scientific article; zbMATH DE number 2246587 (Why is no real title available?)
- Spectral properties of unimodular lattice triangulations
- Fiedler vector analysis for particular cases of connected graphs
- The algebraic connectivity of graphs with given circumference
- Laplacian spectra of coprime graph of finite cyclic and dihedral groups
- scientific article; zbMATH DE number 7473309 (Why is no real title available?)
- Signless Laplacian spectral characterization of some disjoint union of graphs
- Computing Vertex Connectivity: New Bounds from Old Techniques
- Upper bounds on the Laplacian spread of graphs
- Tighter spectral bounds for the cut size, based on Laplacian eigenvectors
- scientific article; zbMATH DE number 2067822 (Why is no real title available?)
- Laplacian spectrum of comaximal graph of the ring \(\mathbb{Z}_n\)
- A new approach based on spectral graph theory to avoiding enclosed holes in topology optimization
- Spectra of graphs resulting from various graph operations and products: a survey
- Rigidity of random subgraphs and eigenvalues of stiffness matrices
- Addressing the envelope reduction of sparse matrices using a genetic programming system
- A lower bound for algebraic connectivity based on the connection-graph-stability method
- A tight upper bound on the spectral radius of bottleneck matrices for graphs
- Quantum algorithm for Boolean equation solving and quantum algebraic attack on cryptosystems
- On singularity and properties of eigenvectors of complex Laplacian matrix of multidigraphs
- Distance Laplacian spectra of graphs: a survey
- A multi-level optimization approach for the planning of heterogeneous sensor networks
- Optimal grid drawings of complete multipartite graphs and an integer variant of the algebraic connectivity
- Improving connectivity of compromised digital networks via algebraic connectivity maximisation
- On synchronization in heterogeneous FitzHugh-Nagumo networks
- On trees with algebraic connectivity greater than or equal to \(2(1-\cos(\frac{\pi}{7}))\)
- Spectral bounds for the connectivity of regular graphs with given order
- A new method optimizing the subgraph centrality of large networks
- Algebraic connectivity on a subclass of caterpillars
- Maximizing the algebraic connectivity for a subclass of caterpillars
- Combinatorial Perron values of trees and bottleneck matrices
- Momentum and stochastic momentum for stochastic gradient, Newton, proximal point and subspace descent methods
- Distributed estimation of algebraic connectivity of directed networks
- A comparison of centrality measures and their role in controlling the spread in epidemic networks
- On the bounds of Laplacian eigenvalues of \(k\)-connected graphs.
- Sixty years of network reliability
- Spectral and structural properties of random interdependent networks
- Stability analysis and output-feedback synthesis of hybrid systems affected by piecewise constant parameters via dynamic resetting scalings
- On some properties of the Laplacian matrix revealed by the RCM algorithm.
This page was built for publication: Old and new results on algebraic connectivity of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q876302)
