1993 | OriginalPaper | Chapter
A Geometric Approach to the Laplacian Matrix of a Graph
Author : Miroslav Fiedler
Published in: Combinatorial and Graph-Theoretical Problems in Linear Algebra
Publisher: Springer New York
Included in: Professional Book Archive
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
Let G be a finite undirected connected graph with n vertices. We assign to G an (n - 1)-simplex ∑(G) in the point Euclidean (n - 1)-space in such a way that the Laplacian L(G) of G is the Gram matrix of the outward normals of ∑(G). It is shown that the spectral properties of L(G) are reflected by the geometric shape of the Steiner circumscribed ellipsoid S of ∑(G) in a simple manner. In particular, the squares of the half-axes of S are proportional to the reciprocals of the eigenvalues of L(G). Also, a previously discovered relationship to resistive electrical circuits is mentioned.