Characteristic polynomial of a graph

From Graph
Revision as of 04:33, 29 May 2012 by Vipul (talk | contribs)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Definition

The characteristic polynomial of a graph is defined as the characteristic polynomial of its adjacency matrix.

Note that this definition can be applied to undirected graphs as well as directed graphs if we use the appropriate definition of characteristic polynomial for each case. It is more typically used for undirected graphs.