Laplacian matrices of graphs: A survey

DOI10.1016/0024-3795(94)90486-3zbMATH Open0802.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

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

• Eigenvalues and expanders
• Eigenvalues of the Laplacian of a graph^∗
• The Laplacian Spectrum of a Graph II
• The distance spectrum of a tree
• On the Shannon capacity of a graph
• 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
• 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
• A Combinatorial Proof of the All Minors Matrix Tree Theorem
• 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
• The expected eigenvalue distribution of a large regular graph
• On the second eigenvalue of a graph
• 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
• Unimodular equivalence of graphs
• Isoperimetric inequalities, growth, and the spectrum of graphs
• An Upper Bound on the Diameter of a Graph from Eigenvalues Associated with Its Laplacian
• On hearing the shape of a drum
• One cannot hear the shape of a drum
• 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)
• Rank one perturbation and its application to the laplacian spectrum of a graph^∗
• Bicycles and Spanning Trees
• Line graphs, root systems, and elliptic geometry
• Better expanders and superconcentrators
• Quadratic forms and the graph isomorphism problem
• Graph complexity and the laplacian matrix in blocked experiments
• Characteristic vertices of trees^*
• Large eigenvalues of the laplacian
• On the geometry and Laplacian of a graph
• 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
• 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
• 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
• The enumeration of directed closed Euler trails and directed Hamiltonian circuits by Lagrangian methods
• The laplacian matrix of a graph: unimodular congruence
• 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
• A NOTE ON THE ENUMERATION AND LISTING OF ALL POSSIBLE TREES IN A CONNECTED LINEAR GRAPH
• Developments in the theory of graph spectra
• Single-hook characters and hamiltonian circuits^∗
• Interpolation theorem for the number of end‐vertices of spanning trees
• 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
• 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?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

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

• Open problem on \(\sigma\)-invariant
• Some properties of the spectrum of graphs
• On the sum of the \(k\) largest eigenvalues of graphs and maximal energy of bipartite graphs
• Laplacian eigenvalue distribution and graph parameters
• Flocking with connectivity preservation for disturbed nonlinear multi-agent systems by output feedback
• Nonsingular mixed graphs with few eigenvalues greater than two
• Characteristic vertices of weighted trees via perron values
• Non-bipartite graphs with third largest Laplacian eigenvalue less than three
• On the eigenvalue two and matching number of a tree
• On the Laplacian energy of a graph
• On Hadamard diagonalizable graphs
• The minimum semidefinite rank of a triangle-free graph
• The minimum signless Laplacian spectral radius of graphs with given independence number
• The Laplacian spectral radius of bicyclic graphs with a given girth
• Algebraic graph theory without orientation
• The effect on the algebraic connectivity of a tree by grafting or collapsing of edges
• Several sharp upper bounds for the largest Laplacian eigenvalue of a graph
• Characterization of extremal graphs from Laplacian eigenvalues and the sum of powers of the Laplacian eigenvalues of graphs
• Exponential number of stationary solutions for Nagumo equations on graphs
• An edge-grafting theorem on Laplacian spectra of graphs and its application
• Algebraic connectivity of weighted trees under perturbation
• The perturbed laplacian matrix of a graph
• Pinning control of complex networks via edge snapping
• On graphs with small number of Laplacian eigenvalues greater than two
• Proof of a conjecture on `plateaux' phenomenon of graph Laplacian eigenvalues
• On the index of necklaces
• Some results on Laplacian spectral radius of graphs with cut vertices
• A new like quantity based on ``Estrada index
• Remarks on Spectral Radius and Laplacian Eigenvalues of a Graph
• Maximizing the distance between center, centroid and characteristic set of a tree
• The spectra of some trees and bounds for the largest eigenvalue of any tree
• A note on Laplacian eigenmaps
• Exciton-mediated quantum search on a star graph
• Arithmetical properties of laplacians of graphs
• Decentralised finite-time attitude synchronisation and tracking control for rigid spacecraft
• Maximizing the Laplacian spectral radii of graphs with given diameter
• A note on sum of powers of the Laplacian eigenvalues of graphs
• Network synchronizability analysis: the theory of subgraphs and complementary graphs
• Stabilization of collective motion on a sphere
• Perron components and algebraic connectivity for weighted graphs
• On the Laplacian spectral radius of bipartite graphs with fixed order and size
• The Laplacian spectral radii of unicyclic and bicyclic graphs with \(n\) vertices and \(k\) pendant vertices
• Bounds on the eigenvalues of graphs with cut vertices or edges
• Nonlinear network dynamics with consensus-dissensus bifurcation
• Upper bound for the Laplacian graph eigenvalues
• On limit points of Laplacian spectral radii of graphs
• The Laplacian spectrum of a mixed graph
• Gain-line graphs via \(G\)-phases and group representations
• Comparison between Laplacian-energy-like invariant and Kirchhoff index
• On Vertex Connectivity and Absolute Algebraic Connectivity for Graphs
• On ordering bicyclic graphs with respect to the Laplacian spectral radius
• Ordering trees with \(n\) vertices and matching number \(q\) by their largest Laplacian eigenvalues
• On the sum of powers of Laplacian eigenvalues of bipartite graphs
• On graphs with the largest Laplacian index
• Partial characterization of graphs having a single large Laplacian eigenvalue
• On the adjacency, Laplacian, and signless Laplacian spectrum of coalescence of complete graphs
• Laplace spectra of orgraphs and their applications
• On Laplacian energy, Laplacian-energy-like invariant and Kirchhoff index of graphs
• On relation between Kirchhoff index, Laplacian-energy-like invariant and Laplacian energy of graphs
• Laplacian spectrum of weakly quasi-threshold graphs
• On bipartite graphs with small number of laplacian eigenvalues greater than two and three
• Ordering connected graphs by their Kirchhoff indices
• From ternary strings to Wiener indices of benzenoid chains
• The bounds of the energy and Laplacian energy of chain graphs
• Bounds on the subdominant eigenvalue involving group inverse with applications to graphs
• On algebraic connectivity as a function of an edge weight
• Spectra of combinatorial Laplace operators on simplicial complexes
• Bounds for the Laplacian spectral radius of graphs
• On the distance Laplacian spectra of graphs
• Title not available (Why is that?)
• Combinatorial and spectral properties of König-Egerváry graphs
• Eigenvalues and diameter
• Bounding the largest eigenvalue of trees in terms of the largest vertex degree
• The algebraic connectivity of graphs with given circumference
• The Laplacian spectral radius for unicyclic graphs with given independence number
• On edge singularity and eigenvectors of mixed graphs
• Spectral bisection of graphs and connectedness
• Some results on the bounds of signless Laplacian eigenvalues
• Cuts and flows of cell complexes
• Some bounds on the largest eigenvalues of graphs
• Bounds for the largest two eigenvalues of the signless Laplacian
• Some results on the ordering of the Laplacian spectral radii of unicyclic graphs
• The smallest Laplacian spectral radius of graphs with a given clique number
• Lower bounds on the (Laplacian) spectral radius of weighted graphs
• On the algebraic connectivity of some caterpillars: a sharp upper bound and a total ordering
• The signless Laplacian spectral radius of graphs with given number of pendant vertices
• On the characterization of graphs with maximum number of spanning trees
• Spectral characterization of some weighted rooted graphs with cliques
• On energy and Laplacian energy of graphs
• On the spectra of some weighted rooted trees and applications
• Spectra of weighted generalized Bethe trees joined at the root
• Consensus formation control for a class of networked multiple mobile robot systems
• On graphs with algebraic connectivity equal to minimum edge density
• Bounds for sums of eigenvalues and applications
• Some results on signless Laplacian coefficients of graphs
• The minimum rank of universal adjacency matrices
• On algebraic connectivity and spectral integral variations of graphs
• A note on sum of powers of the Laplacian eigenvalues of bipartite graphs
• Characterizing graphs with maximal Laplacian Estrada index
• The Laplacian spectral radius of trees and maximum vertex degree

Recommendations

• The Laplacian Spectrum of a Graph 👍 👎
• The Laplacian spectrum of a graph 👍 👎
• A survey of graph laplacians 👍 👎
• On the geometry and Laplacian of a graph 👍 👎
• Some properties of Laplacian eigenvectors 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

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)