Laplacian matrices of graphs: A survey

DOI10.1016/0024-3795(94)90486-3zbMATH Open0802.05053OpenAlexW2144267444MaRDI QIDQ1319985FDOQ1319985

Authors: 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

Recommendations

• The Laplacian spectrum of a graph
• A survey of graph laplacians
• Applications of combinatorial matrix theory to Laplacian matrices of graphs
• scientific article; zbMATH DE number 5575767
• On the geometry and Laplacian of a graph
• The Laplacian Spectrum of a Graph
• Publication:4492988
• On the graphs with larger Laplacian eigenvalues equal to two
• Some properties of Laplacian eigenvectors
• scientific article; zbMATH DE number 867649

zbMATH Keywords

eigenvaluesadjacency matrixLaplacianspectrumalgebraic connectivity

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (only showing first 100 items - show all)

• Adaptive synchronization in complex dynamical networks with coupling delays for general graphs
• Nonpositive eigenvalues of the adjacency matrix and lower bounds for Laplacian eigenvalues
• Minimizing Laplacian spectral radius of unicyclic graphs with fixed girth.
• Edge perturbation on signed graphs with clusters: adjacency and Laplacian eigenvalues
• LAPLACIAN EIGENVALUES OF GRAPHS WITH GIVEN DOMINATION NUMBER
• The spread of the spectrum of a graph
• Upper bounds on the (signless) Laplacian eigenvalues of graphs
• Inequalities and equalities associated with the Campbell-Youla generalized inverse of the indefinite admittance matrix of resistive networks
• Path Laplacian matrices: introduction and application to the analysis of consensus in networks
• On the Laplacian-energy-like invariant
• Laplacian dynamics on general graphs
• The ordering of trees and connected graphs by algebraic connectivity
• Distance matrix and Laplacian of a tree with attached graphs
• Upper bounds on algebraic connectivity via convex optimization
• Applications of Estrada indices and energy to a family of compound graphs
• The Laplacian spectral radius of a graph under perturbation
• On the \(s\)th Laplacian eigenvalue of trees of order \(st+1\)
• On spectral integral variations of mixed graphs
• Multipartite separability of Laplacian matrices of graphs
• The Laplacian spectra of graphs with a tree structure
• Largest eigenvalue of a unicyclic mixed graphs
• On Randić energy
• Ky Fan theorem applied to Randić energy
• Graph connection Laplacian and random matrices with random blocks
• Proof of conjectures involving algebraic connectivity of graphs
• The majorization theorem for signless Laplacian spectral radii of connected graphs
• Laplacian and signless Laplacian spectral radii of graphs with fixed domination number
• On the rank of the distance matrix of graphs
• On (distance) signless Laplacian spectra of graphs
• Extremal Halin graphs with respect to the signless Laplacian spectra
• On the number of spanning trees, the Laplacian eigenvalues, and the Laplacian Estrada index of subdivided-line graphs
• On the signless Laplacian index of cacti with a given number of pendant vertices
• On the signless Laplacian spectra of \(k\)-trees
• A decreasing sequence of upper bounds for the Laplacian energy of a tree
• On incidence energy of graphs
• On the signless Laplacian index of unicyclic graphs with fixed diameter
• Algebraic connectivity of connected graphs with fixed number of pendant vertices
• On distance Laplacian and distance signless Laplacian eigenvalues of graphs
• Shifted simplicial complexes are Laplacian integral
• Edge perturbation on graphs with clusters: adjacency, Laplacian and signless Laplacian eigenvalues
• On the Laplacian spectra of some variants of corona
• On reciprocal eigenvalue property of weighted trees
• The spectrum and the signless Laplacian spectrum of coronae
• On the Laplacian and signless Laplacian spectrum of a graph with \(k\) pairwise co-neighbor vertices
• Frequency-domain criteria for consensus in multiagent systems with nonlinear sector-shaped couplings
• The Laplacian spectral radius of graphs
• Consensus in nonlinear stationary networks with identical agents
• The spectral characterization of butterfly-like graphs
• Some results on the Laplacian spectrum
• The minimal Laplacian spectral radius of trees with diameter 4
• A survey of graph laplacians
• Biobjective optimization problems on matroids with binary costs
• Bounds on the index of the signless Laplacian of a graph
• Sharp bounds for the largest eigenvalue of the signless Laplacian of a graph
• On sum of powers of the Laplacian eigenvalues of graphs
• Rank one perturbation and its application to the laplacian spectrum of a graph^∗
• Applications of combinatorial matrix theory to Laplacian matrices of graphs
• Subdivision schemes for positive definite matrices
• A characterization of spectral integral variation in two places for Laplacian matrices
• Spectral Integral Variations of Degree Maximal Graphs
• Schrödinger operators on periodic discrete graphs
• On the Laplacian spectral radius of trees with fixed diameter
• On the least eigenvalue of a unicyclic mixed graph
• Bounds for incidence energy of some graphs
• Laplacian spectral radius and maximum degree of trees with perfect matchings
• Adaptive exponential synchronization of coupled complex networks on general graphs
• Nonlinear consensus algorithms with uncertain couplings
• On Laplacian-energy-like invariant of a graph
• A sharp upper bound on the largest eigenvalue of the Laplacian matrix of a graph
• Synchronization and tracking of multi-spacecraft formation attitude control using adaptive sliding mode
• Algebraic connectivity and the characteristic set of a graph
• Some bounds for the Kirchhoff index of graphs
• The Laplacian spectrum of a graph
• On distance matrices and Laplacians
• Edge cover by connected bipartite subgraphs
• A note on limit points for algebraic connectivity
• A survey of automated conjectures in spectral graph theory
• Some relations between the eigenvalues of adjacency, Laplacian and signless Laplacian matrix of a graph
• Effects on the distance Laplacian spectrum of graphs with clusters by adding edges
• On incidence energy of a graph
• Laplacian spectral radius of trees with given maximum degree
• The number of spanning trees in odd valent circulant graphs
• On the Laplacian spectral radii of trees
• Consensus and synchronization problems on small-world networks
• Average consensus problems in networks of agents with delayed communications
• Complete split graph determined by its (signless) Laplacian spectrum
• Robust consensus tracking of a class of second-order multi-agent dynamic systems
• Two Laplacians for the distance matrix of a graph
• Kirchhoff index in line, subdivision and total graphs of a regular graph
• Resistance distances and the Kirchhoff index in Cayley graphs
• Ordering (signless) Laplacian spectral radii with maximum degrees of graphs
• de Caen's inequality and bounds on the largest Laplacian eigenvalue of a graph
• On energy of line graphs
• The Laplacian spread of unicyclic graphs
• Tracking control for multi-agent consensus with an active leader and variable topology
• Optimal scaling of a gradient method for distributed resource allocation
• The majorization theorem of extremal pseudographs
• Containment control for a social network with state-dependent connectivity
• Title not available (Why is that?)
• Graphs whose spectrum determined by non-constant coefficients

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1319985)