Old and new results on algebraic connectivity of graphs
From MaRDI portal
Publication:876302
DOI10.1016/J.LAA.2006.08.017zbMATH Open1115.05056OpenAlexW2042018868WikidataQ125749201 ScholiaQ125749201MaRDI QIDQ876302FDOQ876302
Authors: Nair Abreu 
Publication date: 18 April 2007
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2006.08.017
Recommendations
- scientific article; zbMATH DE number 7771352
- 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
extremal graphslimit pointsFiedler vectorsbounds for the algebraic connectivityLaplacian integral graphsLaplacian of graphvertex and edge connectivities
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Extremal problems in graph theory (05C35)
Cites Work
- Eigenvalues and expanders
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Eigenspaces of graphs
- Title not available (Why is that?)
- Laplacian matrices of graphs: A survey
- The limit points of Laplacian spectra of graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Recent results in the theory of graph spectra
- The Laplacian Spectrum of a Graph
- Handbook of Graph Theory
- Laplacian graph eigenvectors
- Parallel concepts in graph theory
- Minimizing algebraic connectivity over connected graphs with fixed girth
- Variable neighborhood search for extremal graphs. I: The AutoGraphiX system
- Extremizing algebraic connectivity subject to graph theoretic constraints
- Title not available (Why is that?)
- Lower bounds for the eigenvalues of Laplacian matrices
- Open problems of Paul Erd�s in graph theory
- Title not available (Why is that?)
- Laplace eigenvalues of graphs---a survey
- Degree maximal graphs are Laplacian integral
- On graphs with equal algebraic and vertex connectivity
- \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
- Eigenvalues, diameter, and mean distance in graphs
- Eigenvectors of acyclic matrices
- Optimal linear labelings and eigenvalues of graphs
- Isomorph-Free Exhaustive Generation
- Title not available (Why is that?)
- A note on limit points for algebraic connectivity
- An Upper Bound on the Diameter of a Graph from Eigenvalues Associated with Its Laplacian
- A survey of graph laplacians
- Absolute algebraic connectivity of trees
- The asymptotic behaviour of Fiedler's algebraic connectivity for random graphs
- Title not available (Why is that?)
- Upper bounds on algebraic connectivity via convex optimization
- A bound on the algebraic connectivity of a graph in terms of the number of cutpoints
- Characteristic vertices of trees*
- Laplacian integral graphs in \(S(a, b)\)
- On a bound on algebraic connectivity: the case of equality
- On graphs with algebraic connectivity equal to minimum edge density
- Variable neighborhood search for extremal graphs. V: Three ways to automate finding conjectures
- On algebraic connectivity and spectral integral variations of graphs
- Completion of Laplacian integral graphs via edge addition
- Tight bounds on the algebraic connectivity of Bethe trees
- Maximizing Algebraic Connectivity Over Unicyclic Graphs
- Algebraic connectivity of weighted trees under perturbation
- Ordering trees by algebraic connectivity
- On Vertex Connectivity and Absolute Algebraic Connectivity for Graphs
- Transportation in graphs and the admittance spectrum
- Tight bounds on the algebraic connectivity of a balanced binary tree
- An upper bound on algebraic connectivity of graphs with many cutpoints
- On the two conjectures of Graffiti
- On the algebraic connectivity of graphs as a function of genus
- Some minimax problems for graphs
- Parameters of connectivity in ()-linear graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (only showing first 100 items - show all)
- Computing tight upper bounds on the algebraic connectivity of certain graphs
- Ordering trees with algebraic connectivity and diameter
- Lower bounds for the algebraic connectivity of graphs with specified subgraphs
- The influence of Miroslav Fiedler on spectral graph theory
- Algebraic connectivity and degree sequences of trees
- Algebraic connectivity for vertex-deleted subgraphs, and a notion of vertex centrality
- Upper bounds on algebraic connectivity via convex optimization
- On distance Laplacian spectral determination of complete multipartite graphs
- Title not available (Why is that?)
- The asymptotic behaviour of Fiedler's algebraic connectivity for random graphs
- Sixty years of network reliability
- The algebraic connectivity of graphs with given circumference
- On the Fiedler vectors of graphs that arise from trees by Schur complementation of the Laplacian
- Synchronization in large-scale nonlinear network systems with uncertain links
- On algebraic connectivity augmentation
- A new method optimizing the subgraph centrality of large networks
- Fiedler vector analysis for particular cases of connected graphs
- Ordering trees by the Laplacian coefficients
- A Note on an Old-Fashioned Algebra for (Disconnected) Graphs
- The Laplacian spectral radius of tricyclic graphs with \(n\) vertices and \(k\) pendant vertices
- On the algebraic connectivity of some caterpillars: a sharp upper bound and a total ordering
- Maximizing algebraic connectivity for certain families of graphs
- Spectral properties of unimodular lattice triangulations
- Cooperative control with distributed gain adaptation and connectivity estimation for directed networks
- Title not available (Why is that?)
- Controllability-Gramian submatrices for a network consensus model
- The Group Inverse of the Laplacian Matrix of a Graph
- Computing Vertex Connectivity: New Bounds from Old Techniques
- Algebraic connectivity of k-connected graphs
- Diameters, distortion, and eigenvalues
- A conjecture on the algebraic connectivity of connected graphs with fixed girth
- Eigenvalues and edge-connectivity of regular graphs
- Signless Laplacian spectral characterization of some disjoint union of graphs
- Algebraic connectivity and doubly stochastic tree matrices
- On (distance) signless Laplacian spectra of graphs
- Augmenting the algebraic connectivity for certain families of graphs
- On algebraic connectivity and spectral integral variations of graphs
- Further results on permanental bounds for the Laplacian matrix of trees
- A lower bound for the algebraic connectivity of a graph in terms of the domination number
- Title not available (Why is that?)
- A sharp upper bound on algebraic connectivity using domination number
- On the maximal error of spectral approximation of graph bisection
- Some graphs determined by their (signless) Laplacian spectra
- New conjectures on algebraic connectivity and the Laplacian spread of graphs
- Characterizing trees with large Laplacian energy
- Node-to-node pinning control of complex networks
- Generating new test instances by evolving in instance space
- Some results on the Laplacian spectrum
- Analytical characterizations of some classes of optimal strongly attack-tolerant networks and their Laplacian spectra
- Absolute algebraic connectivity of double brooms and trees
- Graphs with given diameter maximizing the algebraic connectivity
- \texttt{PQser:} a Matlab package for spectral seriation
- The algebraic connectivity of graphs under perturbation
- Graphs with least eigenvalue \(-2\): ten years on
- Network synchronizability analysis: A graph-theoretic approach
- Applications of combinatorial matrix theory to Laplacian matrices of graphs
- On the Fiedler value of large planar graphs
- On Laplacian spectrum of power graphs of finite cyclic and dihedral groups
- Laplacian spectra of Coprime Graph of finite cyclic and Dihedral groups
- Graph clustering
- Comparison between Laplacian-energy-like invariant and Kirchhoff index
- Laplacian matrices of general complex weighted directed graphs
- On ordering bicyclic graphs with respect to the Laplacian spectral radius
- Ordering trees and graphs with few cycles by algebraic connectivity
- Maxima of the Laplacian spectral radius of (minimally) 2-connected graphs with fixed size
- On Laplacian spectra of parametric families of closely connected networks with application to cooperative control
- A note on limit points for algebraic connectivity
- The algebraic connectivity of graphs with given matching number
- A survey of automated conjectures in spectral graph theory
- Graphs of given order and size and minimum algebraic connectivity
- Consensus and synchronization problems on small-world networks
- Optimal grid drawings of complete multipartite graphs and an integer variant of the algebraic connectivity
- Bifurcations in Nagumo equations on graphs and Fiedler vectors
- Graphs on groups in terms of the order of elements: a review
- On the Fiedler value of large planar graphs (extended abstract)
- On synchronization in heterogeneous FitzHugh-Nagumo networks
- A comparison of centrality measures and their role in controlling the spread in epidemic networks
- New bounds for the signless Laplacian spread
- Tighter spectral bounds for the cut size, based on Laplacian eigenvectors
- A tight upper bound on the spectral radius of bottleneck matrices for graphs
- Spectral Bounds for the Connectivity of Regular Graphs with Given Order
- Quantum algorithm for Boolean equation solving and quantum algebraic attack on cryptosystems
- A divide-and-conquer bound for aggregate's quality and algebraic connectivity
- Laplacian spectrum of comaximal graph of the ring \(\mathbb{Z}_n\)
- Aα and Lα-spectral properties of spider graphs
- On algebraic connectivity of directed scale-free networks
- Potential energy principles in networked systems and their connections to optimization problems on graphs
- On trees with algebraic connectivity greater than or equal to \(2(1-\cos(\frac{\pi}{7}))\)
- Momentum and stochastic momentum for stochastic gradient, Newton, proximal point and subspace descent methods
- Distributed optimisation and control of graph Laplacian eigenvalues for robust consensus via an adaptive multilayer strategy
- Upper bounds on the Laplacian spread of graphs
- Gluing of graph Laplacians and their spectra
- A new approach based on spectral graph theory to avoiding enclosed holes in topology optimization
- Improving connectivity of compromised digital networks via algebraic connectivity maximisation
- A lower bound for algebraic connectivity based on the connection-graph-stability method
- Schur reduction of trees and extremal entries of the Fiedler vector
- On singularity and properties of eigenvectors of complex Laplacian matrix of multidigraphs
- Algebraic connectivity on a subclass of caterpillars
- Maximizing the algebraic connectivity for a subclass of caterpillars
- Stability analysis and output-feedback synthesis of hybrid systems affected by piecewise constant parameters via dynamic resetting scalings
Uses Software
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)
