Nullity (graph theory) (original) (raw)
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 incide
| Property | Value |
|---|---|
| dbo:abstract | 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). (en) |
| dbo:wikiPageID | 17458663 (xsd:integer) |
| dbo:wikiPageLength | 2115 (xsd:nonNegativeInteger) |
| dbo:wikiPageRevisionID | 1012752006 (xsd:integer) |
| dbo:wikiPageWikiLink | dbr:Incidence_matrix dbr:Mathematics dbr:Eigenvalue dbr:Graph_(discrete_mathematics) dbr:Laplacian_matrix dbr:Adjacency_matrix dbr:Graph_theory dbr:Graphic_matroid dbr:Rank_(graph_theory) dbr:Rank_(linear_algebra) dbc:Graph_theory dbr:Circuit_rank dbr:Matrix_theory dbr:Matroid_theory |
| dct:subject | dbc:Graph_theory |
| rdfs:comment | 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 incide (en) |
| rdfs:label | Nullity (graph theory) (en) |
| owl:sameAs | wikidata:Nullity (graph theory) https://global.dbpedia.org/id/2qk2E |
| prov:wasDerivedFrom | wikipedia-en:Nullity_(graph_theory)?oldid=1012752006&ns=0 |
| foaf:isPrimaryTopicOf | wikipedia-en:Nullity_(graph_theory) |
| is dbo:wikiPageDisambiguates of | dbr:Nullity |
| is dbo:wikiPageWikiLink of | dbr:Nullity dbr:Rank_(graph_theory) dbr:Topology_(electrical_circuits) |
| is foaf:primaryTopic of | wikipedia-en:Nullity_(graph_theory) |