Old and new results on algebraic connectivity of graphs
From MaRDI portal
(Redirected from 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)- Computing tight upper bounds on the algebraic connectivity of certain graphs
- Consensus and synchronization problems on small-world networks
- The algebraic connectivity of graphs with given induced matching number
- Ordering trees with algebraic connectivity and diameter
- On the harmonic index and algebraic connectivity
- A survey on distributed network localization from a graph Laplacian perspective
- Lower bounds for the algebraic connectivity of graphs with specified subgraphs
- The influence of Miroslav Fiedler on spectral graph theory
- Optimal grid drawings of complete multipartite graphs and an integer variant of the algebraic connectivity
- Algebraic connectivity and degree sequences of trees
- Algebraic connectivity for vertex-deleted subgraphs, and a notion of vertex centrality
- Bifurcations in Nagumo equations on graphs and Fiedler vectors
- Rigidity of random subgraphs and eigenvalues of stiffness matrices
- Graphs on groups in terms of the order of elements: a review
- Upper bounds on algebraic connectivity via convex optimization
- Network synchronizability analysis: a graph-theoretic approach
- The asymptotic behaviour of Fiedler's algebraic connectivity for random graphs
- On the Fiedler value of large planar graphs (extended abstract)
- On distance Laplacian spectral determination of complete multipartite graphs
- The maximum number of connected sets in regular graphs
- On synchronization in heterogeneous FitzHugh-Nagumo networks
- Sixty years of network reliability
- scientific article; zbMATH DE number 7473309 (Why is no real title available?)
- New bounds for the signless Laplacian spread
- The algebraic connectivity of graphs with given circumference
- Tighter spectral bounds for the cut size, based on Laplacian eigenvectors
- A tight upper bound on the spectral radius of bottleneck matrices for graphs
- A comparison of centrality measures and their role in controlling the spread in epidemic networks
- On the Fiedler vectors of graphs that arise from trees by Schur complementation of the Laplacian
- On algebraic connectivity augmentation
- A multi-level optimization approach for the planning of heterogeneous sensor networks
- Some bounds on the Laplacian eigenvalues of token graphs
- Synchronization in large-scale nonlinear network systems with uncertain links
- Quantum algorithm for Boolean equation solving and quantum algebraic attack on cryptosystems
- A new method optimizing the subgraph centrality of large networks
- Laplacian spectra of coprime graph of finite cyclic and dihedral groups
- A divide-and-conquer bound for aggregate's quality and algebraic connectivity
- Ordering trees by the Laplacian coefficients
- Laplacian spectrum of comaximal graph of the ring \(\mathbb{Z}_n\)
- Bottleneck matrices of maximal outerplanar graphs with isomorphic underlying trees
- Fiedler vector analysis for particular cases of connected graphs
- On algebraic connectivity of directed scale-free networks
- Potential energy principles in networked systems and their connections to optimization problems on graphs
- The Laplacian spectral radius of tricyclic graphs with n vertices and k pendant vertices
- A Note on an Old-Fashioned Algebra for (Disconnected) Graphs
- On the algebraic connectivity of some caterpillars: a sharp upper bound and a total ordering
- Spectral properties of unimodular lattice triangulations
- Maximizing algebraic connectivity for certain families of 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
- scientific article; zbMATH DE number 2075777 (Why is no real title available?)
- Cooperative control with distributed gain adaptation and connectivity estimation for directed networks
- Controllability-Gramian submatrices for a network consensus model
- Diameters, distortion, and eigenvalues
- A conjecture on the algebraic connectivity of connected graphs with fixed girth
- Eigenvalues and edge-connectivity of regular graphs
- The Group Inverse of the Laplacian Matrix of a Graph
- Computing Vertex Connectivity: New Bounds from Old Techniques
- Distributed optimisation and control of graph Laplacian eigenvalues for robust consensus via an adaptive multilayer strategy
- Upper bounds on the Laplacian spread of graphs
- Algebraic connectivity and doubly stochastic tree matrices
- Signless Laplacian spectral characterization of some disjoint union of graphs
- A new approach based on spectral graph theory to avoiding enclosed holes in topology optimization
- On (distance) signless Laplacian spectra of graphs
- Gluing of graph Laplacians and their spectra
- Improving connectivity of compromised digital networks via algebraic connectivity maximisation
- Augmenting the algebraic connectivity for certain families of graphs
- A lower bound for algebraic connectivity based on the connection-graph-stability method
- On some properties of the Laplacian matrix revealed by the RCM algorithm.
- On the bounds of Laplacian eigenvalues of \(k\)-connected graphs.
- Algebraic connectivity in normed spaces
- Some new lower bounds on the algebraic connectivity of graphs
- On algebraic connectivity and spectral integral variations of graphs
- Schur reduction of trees and extremal entries of the Fiedler vector
- 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
- The first Zagreb index, the algebraic connectivity and some Hamiltonian properties of graphs
- On singularity and properties of eigenvectors of complex Laplacian matrix of multidigraphs
- A_ and L_-spectral properties of spider graphs
- Stability analysis and output-feedback synthesis of hybrid systems affected by piecewise constant parameters via dynamic resetting scalings
- Algebraic connectivity on a subclass of caterpillars
- Maximizing the algebraic connectivity for a subclass of caterpillars
- A sharp upper bound on algebraic connectivity using domination number
- On the maximal error of spectral approximation of graph bisection
- New conjectures on algebraic connectivity and the Laplacian spread of graphs
- Some graphs determined by their (signless) Laplacian spectra
- scientific article; zbMATH DE number 2246587 (Why is no real title available?)
- Distance signless Laplacian spectra of graphs: a survey
- Consensus dynamics on random rectangular graphs
- The vertex connectivity and the third largest eigenvalue in regular (multi-)graphs
- Effects on the algebraic connectivity of weighted graphs under edge rotations
- Extreme values of the Fiedler vector on trees
- Sign-changing diagonal perturbations of Laplacian matrices of graphs
- Synchrony and complexity in state-related EEG networks: an application of spectral graph theory
- On the treewidth of token and Johnson graphs
- Characterizing trees with large Laplacian energy
- Generating new test instances by evolving in instance space
- Addressing the envelope reduction of sparse matrices using a genetic programming system
- Some results on the Laplacian spectrum
- Node-to-node pinning control of complex networks
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)
