Laplacian matrices of graphs: A survey

DOI10.1016/0024-3795(94)90486-3zbMath0802.05053OpenAlexW2144267444MaRDI QIDQ1319985

Russell Merris

Publication date: 1 December 1994

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0024-3795(94)90486-3

zbMATH Keywords

eigenvaluesspectrumadjacency matrixLaplacianalgebraic connectivity

Mathematics Subject Classification ID

Applications of graph theory (05C90) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (only showing first 100 items - show all)

A note on unimodular congruence of graphs ⋮ Algebraic graph theory without orientation ⋮ On the multiplicity of Laplacian eigenvalues and Fiedler partitions ⋮ Effect on normalized graph Laplacian spectrum by motif attachment and duplication ⋮ Results on Laplacian spectra of graphs with pockets ⋮ Tracking control for multi-agent consensus with an active leader and variable topology ⋮ Hook immanantal inequalities for Laplacians of trees ⋮ On the spectra of some weighted rooted trees and applications ⋮ Lower bounds of the Laplacian spectrum of graphs based on diameter ⋮ A nontrivial upper bound on the largest Laplacian eigenvalue of weighted graphs ⋮ On the algebraic connectivity of graphs as a function of genus ⋮ On the Laplacian spectral radius of trees with fixed diameter ⋮ Inequalities for the spectra of symmetric doubly stochastic matrices ⋮ Minimizing the Laplacian eigenvalues for trees with given domination number ⋮ A new upper bound for eigenvalues of the Laplacian matrix of a graph ⋮ Optimal scaling of a gradient method for distributed resource allocation ⋮ On trees with exactly one characteristic element ⋮ Wiener number of vertex-weighted graphs and a chemical application ⋮ On the characterization of graphs with maximum number of spanning trees ⋮ Old and new results on algebraic connectivity of graphs ⋮ Laplacian integral graphs in \(S(a, b)\) ⋮ On the von Neumann entropy of a graph ⋮ Hook immanantal inequalities for trees explained ⋮ Containment control for a social network with state-dependent connectivity ⋮ Frequency-domain criteria for consensus in multiagent systems with nonlinear sector-shaped couplings ⋮ Random walks and diffusion on networks ⋮ Distributed estimation of Laplacian eigenvalues via constrained consensus optimization problems ⋮ Flocking with connectivity preservation of multiple double integrator systems subject to external disturbances by a distributed control law ⋮ Multiplicities of distance Laplacian eigenvalues and forbidden subgraphs ⋮ On the Laplacian spectral radius of a tree. ⋮ Domination number and Laplacian eigenvalue distribution ⋮ Graphs with fourth Laplacian eigenvalue less than two ⋮ Consensus in nonlinear stationary networks with identical agents ⋮ Extremal graphs with bounded vertex bipartiteness number ⋮ Relation between signless Laplacian energy, energy of graph and its line graph ⋮ A note on limit points for algebraic connectivity ⋮ On graphs with algebraic connectivity equal to minimum edge density ⋮ On spectral integral variations of mixed graphs ⋮ Two sharp upper bounds for the Laplacian eigenvalues. ⋮ A note on 2-isomorphisms and the signed Laplacian matrix of a graph ⋮ A sharp lower bound on the least signless Laplacian eigenvalue of a graph ⋮ Spectra of weighted generalized Bethe trees joined at the root ⋮ On the spectrum of the normalized graph Laplacian ⋮ Bipartite graphs with small third Laplacian eigenvalue. ⋮ On graphs with at most three Laplacian eigenvalues greater than or equal to two. ⋮ Some bounds for the Kirchhoff index of graphs ⋮ Network synchronizability analysis: the theory of subgraphs and complementary graphs ⋮ On edge singularity and eigenvectors of mixed graphs ⋮ The Laplacian spectral radii of trees with degree sequences ⋮ On two conjectures of spectral graph theory ⋮ New bounds for the signless Laplacian spread ⋮ Synchronization in large-scale nonlinear network systems with uncertain links ⋮ Ordering trees with \(n\) vertices and matching number \(q\) by their largest Laplacian eigenvalues ⋮ On the minimum Kirchhoff index of graphs with a given vertex \(k\)-partiteness and edge \(k\)-partiteness ⋮ The spectra and the signless Laplacian spectra of graphs with pockets ⋮ On line graphs with maximum energy ⋮ On limit points of Laplacian spectral radii of graphs ⋮ Laplacian spectral radius of trees with given maximum degree ⋮ Some results on the ordering of the Laplacian spectral radii of unicyclic graphs ⋮ Duality and the signed Laplacian matrix of a graph ⋮ Proof of conjecture involving algebraic connectivity and average degree of graphs ⋮ Towards a spectral theory of graphs based on the signless Laplacian. II. ⋮ A survey of automated conjectures in spectral graph theory ⋮ Mean square average-consensus under measurement noises and fixed topologies: necessary and sufficient conditions ⋮ Kirchhoff index of composite graphs ⋮ The signless Laplacian spectral radius of graphs with given degree sequences ⋮ On conjectures involving second largest signless Laplacian eigenvalue of graphs ⋮ Bounds on the index of the signless Laplacian of a graph ⋮ Largest eigenvalue of a unicyclic mixed graphs ⋮ The Laplacian spectrum of a graph ⋮ On the spectra of nonsymmetric Laplacian matrices ⋮ The Laplacian spectral radius of bicyclic graphs with a given girth ⋮ On algebraic connectivity and spectral integral variations of graphs ⋮ Sharp bounds for the largest eigenvalue of the signless Laplacian of a graph ⋮ The Laplacian spectral radius for unicyclic graphs with given independence number ⋮ On distance matrices and Laplacians ⋮ Upper bound for the Laplacian graph eigenvalues ⋮ Chromatic number and spectral radius ⋮ On the Laplacian spectral radii of bicyclic graphs ⋮ Stabilization of collective motion on a sphere ⋮ Algebraic connectivity and doubly stochastic tree matrices ⋮ The Laplacian spectral radius of a graph under perturbation ⋮ Maximizing the Laplacian spectral radii of graphs with given diameter ⋮ A note on sum of powers of the Laplacian eigenvalues of bipartite graphs ⋮ Laplacian spectrum of weakly quasi-threshold graphs ⋮ First eigenvalue and first eigenvectors of a nonsingular unicyclic mixed graph ⋮ The lollipop graph is determined by its \(Q\)-spectrum ⋮ Graph spectra as a systematic tool in computational biology ⋮ Coordination in multiagent systems and Laplacian spectra of digraphs ⋮ On resistance-distance and Kirchhoff index ⋮ Bounds for sums of eigenvalues and applications ⋮ Some properties of the spectrum of graphs ⋮ Ordering trees by the Laplacian coefficients ⋮ The signless Laplacian spectral radius of graphs with given number of pendant vertices ⋮ On the Laplacian spectral radii of trees ⋮ The signless Laplacian spread ⋮ On the algebraic connectivity of some caterpillars: a sharp upper bound and a total ordering ⋮ Lower bounds for the eigenvalues of Laplacian matrices ⋮ A sharp upper bound on the largest eigenvalue of the Laplacian matrix of a graph ⋮ The spectrum of the Laplacian matrix of a balanced binary tree

Cites Work

• Schur convex functions on the spectra of graphs
• Permanent of the Laplacian matrix of trees and bipartite graphs
• \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
• Permanental roots and the star degree of a graph
• Quadratic forms and the graph isomorphism problem
• Inequalities and identities for generalized matrix functions
• A bound for the permanent of the Laplacian matrix
• Transportation in graphs and the admittance spectrum
• Nonisomorphic graphs with the same t-polynomial
• Permanent of the Laplacian matrix of trees with a given matching
• Isoperimetric inequalities, growth, and the spectrum of graphs
• Eigenvalues and expanders
• Arithmetical graphs
• The enumeration of directed closed Euler trails and directed Hamiltonian circuits by Lagrangian methods
• The expected eigenvalue distribution of a large regular graph
• Permanental polynomials of graphs
• A generalization of the matrix-tree theorem
• Note on graphs and weakly cyclic matrices
• On the geometry and Laplacian of a graph
• Eigenvalues, diameter, and mean distance in graphs
• Cycles and spanning trees
• On the second eigenvalue of a graph
• A finite group attached to the laplacian of a graph
• The asymptotic behaviour of Fiedler's algebraic connectivity for random graphs
• Immanants of combinatorial matrices
• Unimodular equivalence of graphs
• An enumerating function for spanning forests with color restrictions
• Lower bounds for the first eigenvalue of certain M-matrices associated with graphs
• Recent results in the theory of graph spectra
• Two problems involving Schur functions
• On the distance matrix of a tree
• Line graphs, root systems, and elliptic geometry
• Nonisomorphic trees with the same T-polynomial
• Matrix tree theorems
• Distance matrix polynomials of trees
• Factoring distance matrix polynomials
• Unimodular congruence of the Laplacian matrix of a graph
• A certain polynomial of a graph and graphs with an extremal number of trees
• Sur un nouvel invariant des graphes et un critère de planarité. (On a new graph invariant and a planarity criterion)
• Multiplicity of integer roots of polynomials of graphs
• On a conjecture of Graham and Lovász about distance matrices
• Isoperimetric numbers of graphs
• Single-hook characters and hamiltonian circuits^∗
• Almost all trees share a complete set of immanantal polynomials
• Large eigenvalues of the laplacian
• Graph complexity and the laplacian matrix in blocked experiments
• An edge version of the matrix-tree theorem and the wiener index
• On $W$-bases of directed graphs
• The distance spectrum of the pathP_nand The First Distance Eigenvector of Connected Graphs
• The Laplacian Spectrum of a Graph
• The distance spectrum of a tree
• Partitioning Sparse Matrices with Eigenvectors of Graphs
• A Topological Application of the Isoperimetric Inequality
• Bicycles and Spanning Trees
• Eigenvalues of the Laplacian of a graph^∗
• Maximality of the monomial group
• Principal subpermanents of the Laplacian matrix
• The Second Immanantal Polynomial and the Centroid of a Graph
• Better expanders and superconcentrators
• Can One Hear the Shape of a Drum? Revisited
• Diameters and Eigenvalues
• Interpolation theorem for the number of end‐vertices of spanning trees
• A Combinatorial Proof of the All Minors Matrix Tree Theorem
• One cannot hear the shape of a drum
• Laplacian Permanents of Trees
• Eigenvectors of acyclic matrices
• Matrix Generalizations of Some Theorems on Trees, Cycles and Cocycles in Graphs
• On the Shannon capacity of a graph
• Rank one perturbation and its application to the laplacian spectrum of a graph^∗
• The Laplacian Spectrum of a Graph II
• An Upper Bound on the Diameter of a Graph from Eigenvalues Associated with Its Laplacian
• Absolute algebraic connectivity of trees
• Coalescence, majorization, edge valuations and the laplacian spectra of graphs
• The laplacian matrix of a graph: unimodular congruence
• Developments in the theory of graph spectra
• The Laplacian permanental polynomial for trees
• Can One Hear the Shape of a Drum?
• On hearing the shape of a drum
• An introduction to chromatic polynomials
• Generalized Matrix Functions and the Graph Isomorphism Problem
• Conversion of the Permanent into the Determinant
• On the Addressing Problem for Loop Switching
• A NOTE ON THE ENUMERATION AND LISTING OF ALL POSSIBLE TREES IN A CONNECTED LINEAR GRAPH
• Characteristic vertices of trees^*
• Inequalities: theory of majorization and its applications
• Ordering trees by algebraic connectivity
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Laplacian matrices of graphs: A survey