A survey of graph laplacians

1995/07/01 by Russell Merris · 8 citations
Mathematics · Computer Science · #Graph theory and applications #Advanced Graph Theory Research #Limits and Structures in Graph Theory

paper · doi:10.1080/03081089508818377

Abstract

Abstract Let G be a graph on n vertices. Its Laplacian is the n-by-n matrix L(G)−D(G)−A(G), where D(G) is the diagonal matrix of vertex degrees and A(G) is the (0,1)-adjacency matrix of G. This article surveys recent results on graph Laplacians. 1This article was prepared in conjunction with the ICMS workshop on Algebraic Graph Theory at the University of Edinburgh, July 12 10. 1993. 1This article was prepared in conjunction with the ICMS workshop on Algebraic Graph Theory at the University of Edinburgh, July 12 10. 1993. Notes 1This article was prepared in conjunction with the ICMS workshop on Algebraic Graph Theory at the University of Edinburgh, July 12 10. 1993.

Cited by

• Cubic bipartite graphs with minimum spectral gap
• Diffusion Signals Reveal Hidden Connections: A Physics-Inspired Framework for Link Prediction via Personalized PageRank Signals
• Sufficient conditions for localized vibrational modes in one- and two-dimensional discrete lattices
• Interacting many-body non-Hermitian systems as Markov chains
• Least Squares Ranking on Graphs
• On the spectra of nonsymmetric Laplacian matrices
• Laplacian Coefficients of a Forest in terms of the Number of Closed Walks in the Forest and its Line Graph
• Graph Energies of Egocentric Networks and Their Correlation with Vertex Centrality Measures. [europepmc]

Related

• Graph Laplacians with Higher Accuracy
• On Laplacian and Distance Laplacian Spectra of Generalized Fan Graph & a New Graph Class
• Unifying adjacency, Laplacian, and signless Laplacian theories
• Two Laplacians for the resistance distance matrix of a graph
• Matrix tree theorem for the net Laplacian matrix of a signed graph