A combinatorial Laplacian with vertex weights
From MaRDI portal
Publication:1924229
DOI10.1006/jcta.1996.0080zbMath0866.05039OpenAlexW2084415193MaRDI QIDQ1924229
Robert P. Langlands, Fan R. K. Chung
Publication date: 20 July 1997
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/2ee43142ac9a049104c9707b28c6b68dea00443b
Dirichlet boundary conditiondeterminantLaplacianBethe Ansatzmatrixmatrix-tree theoremspanning treesspanning forestsvertex weights
Related Items
Distance Laplacian spectra of joined union of graphs, Boundary Value Problems on Finite Networks, SEIDEL SPECTRUM OF THE ZERO-DIVISOR GRAPH ON THE RING OF INTEGERS MODULO n, Data Analytics on Graphs Part I: Graphs and Spectra on Graphs, Holographic algorithms without matchgates, Enumeration of spanning trees of middle digraphs, Forest formulas of discrete Green's functions, Sandpile groups and spanning trees of directed line graphs, Green functions on product networks, Oriented spanning trees and stationary distribution of digraphs, A Nonlocal Graph-PDE and Higher-Order Geometric Integration for Image Labeling, Weighted spectra on a weighted geometric realization of 2-simplexes and 3-simplexes, The Kirchhoff indexes of some composite networks, Graph coverings and twisted operators, Spectral zeta functions of graphs and the Riemann zeta function in the critical strip, Spectra of combinatorial Laplace operators on simplicial complexes, An interlacing technique for spectra of random walks and its application to finite percolation clusters, Unnamed Item, Generalized counting constraint satisfaction problems with determinantal circuits, Hodge decomposition and the Shapley value of a cooperative game, Dirichlet problem on locally finite graphs, The \(\rho\)-moments of vertex-weighted graphs, Kirchhoff indexes of a network, Unnamed Item, New proofs for Levine's theorems, Vertex Weighted Complexities of Graph Coverings, The enumeration of spanning tree of weighted graphs, The Laplacian spectra of graphs with a tree structure, Error graphs and the reconstruction of elements in groups, Oriented hypergraphic matrix-tree type theorems and bidirected minors via Boolean order ideals, Optimal designs for treatment comparisons represented by graphs, Tree and forest weights and their application to nonuniform random graphs, Laplacian eigenvalues of the zero divisor graph of the ring \(\mathbb{Z}_n\), Discrete Green's functions, Forest matrices around the Laplacian matrix, Faber–Krahn type inequality for unicyclic graphs, Group inverse matrix of the normalized Laplacian on subdivision networks
