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)

• 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
• Some remarks on Laplacian eigenvalues of connected graphs
• Laplacian matrix of a weighted graph with new pendant vertices
• A generalized least-square matrix decomposition
• The Laplacian spectral radii of trees with degree sequences
• Second-order multiagent systems with event-driven consensus control
• Spanning trees: A survey
• On energy and Laplacian energy of bipartite graphs
• On Laplacian energy in terms of graph invariants
• Coordination in multiagent systems and Laplacian spectra of digraphs
• On resistance-distance and Kirchhoff index
• On conjectures involving second largest signless Laplacian eigenvalue of graphs
• Ordering trees by the Laplacian coefficients
• Eigenvalues and the degree sequences of graphs
• On the Laplacian spectral ratio of connected graphs
• Note on the \(k\)th Laplacian eigenvalues of trees with perfect matchings
• Two sharp upper bounds for the Laplacian eigenvalues.
• The effect on the Laplacian spectral radius of a graph by adding or grafting edges
• Laplacian energy of a graph
• On the Estrada and Laplacian Estrada indices of graphs
• Relation between signless Laplacian energy, energy of graph and its line graph
• Towards a spectral theory of graphs based on the signless Laplacian. II.
• Some results on the Laplacian spread of a graph
• On the sum of powers of Laplacian eigenvalues of bipartite graphs
• The Laplacian and signless Laplacian spectrum of semi-Cayley graphs over abelian groups
• Some graphs determined by their spectra
• Laplacian spread of graphs: lower bounds and relations with invariant parameters
• Comparison between Kirchhoff index and the Laplacian-energy-like invariant
• Hamilton cycles and eigenvalues of graphs
• Mean square average-consensus under measurement noises and fixed topologies: necessary and sufficient conditions
• First eigenvalue and first eigenvectors of a nonsingular unicyclic mixed graph
• Chromatic number and spectral radius
• Distribution of Laplacian eigenvalues of graphs
• Trapping of continuous-time quantum walks on Erdős-Rényi graphs
• A nontrivial upper bound on the largest Laplacian eigenvalue of weighted graphs
• Lower bounds of the Laplacian spectrum of graphs based on diameter
• Properties of spectra of graphs and line graphs
• The limit points of Laplacian spectra of graphs
• On the spectrum of the normalized graph Laplacian
• Wiener number of vertex-weighted graphs and a chemical application
• Kirchhoff index of composite graphs
• On the Laplacian spectral radius of a tree.
• Old and new results on algebraic connectivity of graphs
• The Grone-Merris conjecture
• The signless Laplacian spectral radius of graphs with given degree sequences
• Graph spectra as a systematic tool in computational biology
• Algebraic connectivity of an even uniform hypergraph
• The Laplacian spread of graphs.
• The lollipop graph is determined by its \(Q\)-spectrum
• Lower bounds for the eigenvalues of Laplacian matrices
• Fast linear iterations for distributed averaging
• Bounds for the least Laplacian eigenvalue of a signed graph
• Some graphs determined by their (signless) Laplacian spectra
• Effect on normalized graph Laplacian spectrum by motif attachment and duplication
• Robust consensus tracking for a class of high-order multi-agent systems
• The signless Laplacian spread
• A note on the second largest eigenvalue of the laplacian matrix of a graph^∗
• Computing the degree of a lattice ideal of dimension one
• On Laplacian energy of graphs
• On the spectra of nonsymmetric Laplacian matrices
• Robust consensus tracking for an integrator-type multi-agent system with disturbances and unmodelled dynamics
• First eigenvalue of nonsingular mixed graphs with given number of pendant vertices
• Tree simplification and the `plateaux' phenomenon of graph Laplacian eigenvalues
• The Laplacian polynomial and Kirchhoff index of graphs derived from regular graphs
• Some graphs determined by their (signless) Laplacian spectra.
• The characteristic polynomial of the Laplacian of graphs in (\(a\), \(b\))-linear classes
• Sharp upper and lower bounds for largest eigenvalue of the Laplacian matrices of trees
• Bounding the gap between extremal Laplacian eigenvalues of graphs
• Lower bounds of the Laplacian graph eigenvalues
• The least eigenvalue of the signless Laplacian of the complements of trees
• Distributed leaderless consensus algorithms for networked Euler–Lagrange systems
• On algebraic connectivity of graphs with at most two points of articulation in each block
• A sharp upper bound for the number of spanning trees of a graph
• The tau constant and the discrete Laplacian matrix of a metrized graph
• Several improved asymptotic normality criteria and their applications to graph polynomials
• On eigenvectors of mixed graphs with exactly one nonsingular cycle
• On the Laplacian Eigenvalues of Signed Graphs
• Laplacian spectral characterization of disjoint union of paths and cycles
• Spectra of combinatorial Laplace operators on simplicial complexes
• Bounds of Laplacian spectrum of graphs based on the domination number
• Network synchronizability analysis: a graph-theoretic approach
• Bounds for the Laplacian spectral radius of graphs
• The signless Laplacian spectral radius of bicyclic graphs with prescribed degree sequences
• On the distance Laplacian spectra of graphs
• Combinatorial and spectral properties of König-Egerváry graphs
• Eigenvalues and diameter

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)