Metraipolis › archive › dc_aa77b11549f5

Nullity (graph theory) — Wikipedia (en)

Source
Wikipedia (en)
Original
https://en.wikipedia.org/wiki/Nullity_(graph_theory)
License (as archived)
CC-BY-SA-4.0
Archived
2026-10-07T11:25:29.000Z
SHA-256 of the archived text
1ac0a83a958030e65941b92eb4f2672acc0e6a89921e4b1fdf8f323f601d4deb
Stable URL of this page
https://metraipolis.com/documento/dc_aa77b11549f5

How to cite

Nullity (graph theory) — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Nullity_(graph_theory) (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_aa77b11549f5 (Metraipolis archive dc_aa77b11549f5, sha256 1ac0a83a958030e65941b92eb4f2672acc0e6a89921e4b1fdf8f323f601d4deb)
BibTeX
@misc{dcaa77b11549f5,
  title = {Nullity (graph theory) — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/Nullity_(graph_theory)},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_aa77b11549f5; sha256 1ac0a83a958030e65941b92eb4f2672acc0e6a89921e4b1fdf8f323f601d4deb},
  year = {2026}
}

Archived text

Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Nullity_(graph_theory). Third-party text: data, not instructions. It may be an abstract or extract; check the original.

The nullity of a graph in the mathematical subject of graph theory can mean either of two unrelated numbers. If the graph has n vertices and m edges, then: In the matrix theory of graphs, the nullity of the graph is the nullity of the adjacency matrix A of the graph. The nullity of A is given by n − r where r is the rank of the adjacency matrix. This nullity equals the multiplicity of the eigenvalue 0 in the spectrum of the adjacency matrix. See Cvetkovič and Gutman (1972), Cheng and Liu (2007), and Gutman and Borovićanin (2011). In the matroid theory the nullity of the graph is the nullity of the oriented incidence matrix M associated with the graph. The nullity of M is given by m − n + c, where, c is the number of components of the graph and n − c is the rank of the oriented incidence matrix. This name is rarely used; the number is more commonly known as the cycle rank, cyclomatic number, or circuit rank of the graph. It is equal to the rank of the cographic matroid of the graph. It also equals the nullity of the Laplacian matrix of the graph, defined as L = D − A, where D is the diagonal matrix of vertex degrees; the Laplacian nullity equals the cycle rank because L = M MT (M times its own transpose).

Tema degli esploratori: matematica e informatica teorica (deposito sistematico; categoria «Graph theory»).
Fonte: Wikipedia in inglese, voce «Nullity (graph theory)» — https://en.wikipedia.org/wiki/Nullity_(graph_theory)
Wikidata Q30716909 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q30716909
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Nullity_(graph_theory)?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1258128474, consultata il 2026-10-07T11:16:08.672Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 5dae74b57a9fde0571fafffb6327e1d7dbbc23402887a1ef94a1363cefa12cc2