Characteristic polynomial of a graph: Difference between revisions
(Created page with "==Definition== The '''characteristic polynomial of a graph''' is defined as the [[defining ingredient::characteristic polynomial of a square matrix|characteristic polynomial]...") |
No edit summary |
||
| Line 2: | Line 2: | ||
The '''characteristic polynomial of a graph''' is defined as the [[defining ingredient::characteristic polynomial of a square matrix|characteristic polynomial]] of its [[defining ingredient::adjacency matrix]]. | The '''characteristic polynomial of a graph''' is defined as the [[defining ingredient::characteristic polynomial of a square matrix|characteristic polynomial]] of its [[defining ingredient::adjacency matrix]]. | ||
Note that this definition can be applied to [[undirected graph]]s as well as [[directed graph]]s if we use the appropriate definition of characteristic polynomial for each case. It is more typically used for undirected graphs. | |||
Latest revision as of 04:33, 29 May 2012
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.