Laplacian matrices of graphs: a survey

1994/01/01 by Russell Merris · 1,529 citations
Chemistry · Computer Science · Mathematics · #Adjacency matrix #Algebraic connectivity #Combinatorics #Degree matrix #Diagonal #Diagonal matrix #Discrete mathematics #Eigenvalues and eigenvectors #Graph #Graph power #Graph theory and applications #Integer matrix #Laplace operator #Laplacian matrix #Line graph #Mathematics #Matrix (chemical analysis) #Nonnegative matrix #Physics #Symmetric matrix #Synthesis and Properties of Aromatic Compounds #Topological and Geometric Data Analysis #Vertex (graph theory)

paper · pdf · doi:10.1016/0024-3795(94)90486-3

published in Linear Algebra and its Applications 197-198, 143-176 (Elsevier BV)

openalex publication_date 1994/01/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/06

Citations

• Ueber die Auflösung der Gleichungen, auf welche man bei der Untersuchung der linearen Vertheilung galvanischer Ströme geführt wird
• Can One Hear the Shape of a Drum?
• 2-Isomorphic Graphs

Cited by

• Path Laplacian matrices: Introduction and application to the analysis of consensus in networks
• The ordering of trees and connected graphs by algebraic connectivity
• Heterophilious Dynamics Enhances Consensus
• Tight Conic Relaxations for Rank-one Doubly Nonnegative Matrix Completion
• Diffusion-induced instabilities promote cooperation in eco-evolutionary networks
• The Laplacian spectrum of hierarchical product graphs and unique prime factorization
• Efficient Estimation for Random Dot Product Graphs via a One-step Procedure
• Signless Laplacian determinations of some graphs with independent edges
• Cubic bipartite graphs with minimum spectral gap
• On the spectral determinations of the connected multicone graphs K_r\bigtriangledown sK_t
• Graph-based Nearest Neighbors with Dynamic Updates via Random Walks
• FairExpand: Individual Fairness on Graphs with Partial Similarity Information
• Limit theorems for eigenvectors of the normalized Laplacian for random graphs
• Using Laplacian Spectrum as Graph Feature Representation
• From Laplacian-to-Adjacency Matrix for Continuous Spins on Graphs
• The Laplacian Eigenvalues and Invariants of Graphs
• A Relative Laplacian spectral recursion
• Machine Learning for Health: Personalized Models for Forecasting of Alzheimer Disease Progression
• Optimal Dynamic Formation Control of Multi-Agent Systems in Environments with Obstacles
• SVD-Based UGRM-GFT on Directed Product Graphs
• Threshold graph limits and random threshold graphs
• Nonpositive Eigenvalues of the Adjacency Matrix and Lower Bounds for Laplacian Eigenvalues
• Enumeration of Laplacian integral and -1,0,1-diagonalizable graphs
• MolBar: a molecular identifier for inorganic and organic molecules with full support of stereoisomerism
• Hook immanantal equalities for linear combination matrices of (di)graphs and their applications
• Doubly Stochastic Matrices and Modified Laplacian Matrices of Graphs
• On the structure and skeletals of principal ideal graphs of inverse semigroups
• Characterizing the second smallest eigenvalue of the normalized Laplacian of a tree
• Interacting many-body non-Hermitian systems as Markov chains
• The biharmonic index of connected graphs
• Spectral Analysis of Laplacians of an Unweighted and Weighted Multidimensional Grid Graph -- Combinatorial versus Normalized and Random Walk Laplacians
• CbLDM: A Diffusion Model for recovering nanostructure from atomic pair distribution function
• Robust Cooperative Formation Control of Fixed-Wing Unmanned Aerial Vehicles
• Beyond Turing: Memory-Amortized Inference as a Foundation for Cognitive Computation
• A few properties of the eigenvalues of normalized graph Laplacian
• Chip-firing may be much faster than you think
• A network approach to detect Value Added Tax fraud
• Sums of Laplacian eigenvalues and sums of degrees
• Diffusion and Consensus in a Weakly Coupled Network of Networks
• On the spectra of nonsymmetric Laplacian matrices
• ChipletPart: Cost-Aware Partitioning for 2.5D Systems
• How likely is a random graph shift-enabled?
• On the edge reconstruction of the second immanantal polynomials of undirected graph and digraph
• Optimization of convergence rate via algebraic connectivity
• Heat Kernel Goes Topological
• Non-backtracking Spectrum: Unitary Eigenvalues and Diagonalizability
• Extremal Graph Theory for Degree Sequences
• Ecologically Sustainable Partitioning of a Metapopulations Network
• Some improved bounds on two energy-like invariants of some derived graphs
• Learnable quantum spectral filters for hybrid graph neural networks
• A highly parallel algorithm for computing the action of a matrix exponential on a vector based on a multilevel Monte Carlo method
• A sharp upper bound for the independence number
• 3D Dense Face Alignment via Graph Convolution Networks
• The primal-dual hybrid gradient method reduces to a primal method for linearly constrained optimization problems
• The spectra and the signless Laplacian spectra of graphs with pockets
• Maximum Throughput Problem in Dissipative Flow Networks with Application to Natural Gas Systems
• On the Unity Row Summation and Real Valued Nature of the F_LG Matrix
• Extreme Values of the Fiedler Vector on Trees
• Girth and Laplacian eigenvalue distribution
• Equivalence between spectral properties of graphs with and without loops
• Algebraic connectivity of connected graphs with fixed number of pendant vertices
• Support Consistency of Direct Sparse-Change Learning in Markov Networks
• Bipartite and neighborhood graphs and the spectrum of the normalized graph Laplacian
• Incremental Method for Spectral Clustering of Increasing Orders
• Accelerated MM Algorithms for Ranking Scores Inference from Comparison Data
• The Spectrum of the Corona of Two Graphs
• Learning Kronecker-Structured Graphs from Smooth Signals
• A stopping criterion for Markov chains when generating independent random graphs
• Clustering on Multiple Incomplete Datasets via Collective Kernel Learning
• More graphs with pair state transfer
• Indirect Influence on Network Diffusion
• Dynamics of gelling liquids: a short survey
• A graph discretization of vector Laplace operator
• Coordination in multiagent systems and Laplacian spectra of digraphs
• Scale-free Loopy Structure is Resistant to Noise in Consensus Dynamics in Complex Networks
• Spectral plots and the representation and interpretation of biological data
• Lost in Tokenization: Fundamental Trade-offs in Graph Tokenization for Transformers
• Color graph based wavelet transform with perceptual information
• Riordan graphs II: Spectral properties
• Iterative learning control in prosumer-based microgrids with hierarchical control
• Tracking control for multi-agent consensus with an active leader and variable topology
• A Recursive Characterization of Laplacian Spectral Radii of Trees with Bounded Maximum Degree
• A spectral bound for graph irregularity
• Structural Robustness to Noise in Consensus Networks: Impact of Degrees and Distances, Fundamental Limits, and Extremal Graphs
• A general approach to distributed operator splitting
• Effective resistance is more than distance: Laplacians, Simplices and the Schur complement
• AI-Driven Consensus: Modeling Multi-Agent Networks with Long-Range Interactions through path-Laplacian Matrices
• Wiener Index of Trees: Theory and Applications
• On the Laplacian spectral radii of Halin graphs. [europepmc]
• Dynamics of collective performance in collaboration networks. [europepmc]
• Partitioning a reaction-diffusion ecological network for dynamic stability. [europepmc]
• Topology Effects on Sparse Control of Complex Networks with Laplacian Dynamics. [europepmc]
• Graph theory for analyzing pair-wise data: application to geophysical model parameters estimated from interferometric synthetic aperture radar data at Okmok volcano, Alaska. [europepmc]
• Polaritons and excitons: Hamiltonian design for enhanced coherence. [europepmc]
• Computing the Partial Correlation of ICA Models for Non-Gaussian Graph Signal Processing. [europepmc]
• A New Surrogating Algorithm by the Complex Graph Fourier Transform (CGFT). [europepmc]
• Random-Walk Laplacian for Frequency Analysis in Periodic Graphs. [europepmc]
• Matryoshka and disjoint cluster synchronization of networks. [europepmc]
• Clustering single-cell multimodal omics data with jrSiCKLSNMF. [europepmc]
• A New Decomposition of the Graph Laplacian and the Binomial Structure of Mass-Action Systems. [europepmc]
• MDAR: A Multiscale Features-Based Network for Remotely Measuring Human Heart Rate Utilizing Dual-Branch Architecture and Alternating Frame Shifts in Facial Videos. [europepmc]
• Robust sparse smooth principal component analysis for face reconstruction and recognition. [europepmc]