Graph energy

Uses your system voice; voice and rate in settings.

Snapshot

≈ 2 min read

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

In mathematics, the energy of a graph is the sum of the absolute values of the eigenvalues of the adjacency matrix of the graph. This quantity is studied in the context of spectral graph theory. More precisely, let G be a graph with n vertices. It is assumed that G is a simple graph, that is, it does not contain loops or parallel edges. Let A be the adjacency matrix of G and let \lambda_i , i = 1 , \ldots , n , be the eigenvalues of A. Then the energy of the graph is defined as: : E(G) = \sum_{i=1}^n|\lambda_i|.

In mathematics, the energy of a graph is the sum of the absolute values of the eigenvalues of the adjacency matrix of the graph. This quantity is studied in the context of spectral graph theory. More precisely, let G be a graph with n vertices. It is assumed that G is a simple graph, that is, it does not contain loops or parallel edges. Let A be the adjacency matrix of G and let \lambda_i , i = 1 , \ldots , n , be the eigenvalues of A. Then the energy of the graph is defined as: E(G) = \sum_{i=1}^n|\lambda_i|.

Text derived from https://en.wikipedia.org/w/index.php?oldid=1258127834 under CC BY-SA 4.0; modifications have been made.

Sources cited in this revision

No external citation was extracted for this revision. That is a statement about the source, not a claim that none exists.