Title:
A Generalization of the Characteristic Polynomial of a Graph
A Generalization of the Characteristic Polynomial of a Graph
Authors
Lipton, Richard J.
Vishnoi, Nisheeth Kumar
Zalcstein, Yechezkel (Zeke)
Vishnoi, Nisheeth Kumar
Zalcstein, Yechezkel (Zeke)
Authors
Advisors
Advisors
Associated Organizations
Organizational Unit
Series
Collections
Supplementary to
Permanent Link
Abstract
Given a graph G with its adjacency matrix A, consider the matrix A(x, y) in which the 1s
are replaced by the indeter0minate x and 0s (other than the diagonals) are replaced by y. The
ℒ-polynomial of G is defined as:
ℒ[subscriptG](x, y, λ) := det(A(x, y) λI).
This polynomial is a natural generalization of the standard characteristic polynomial of a
graph.
In this note we characterize graphs which have the same ℒ-polynomial. The answer is
rather simple: Two graphs G and H have the same ℒ-polynomial if and only if - G and H are
co-spectral and G[subscript c] and H[subscript c] are co-spectral. (Here G[subscript c] (resp. H[subscript c]) is the complement of G (resp.
H).)
Sponsor
Date Issued
2003
Extent
115514 bytes
Resource Type
Text
Resource Subtype
Technical Report