Category:Graph invariants
From HandWiki
Here is a list of articles in the category Graph invariants of the Computing portal that unifies foundations of mathematics and computations using computers.
 |
Wikimedia Commons has media related to Graph invariants. |
Graph invariants are properties of graphs that are invariant under graph isomorphisms: each is a function [math]\displaystyle{ f\, }[/math] such that [math]\displaystyle{ f(G_1)=f(G_2)\, }[/math] whenever [math]\displaystyle{ G_1\, }[/math] and [math]\displaystyle{ G_2\, }[/math] are isomorphic graphs. Examples include the number of vertices and the number of edges.
Pages in category "Graph invariants"
The following 97 pages are in this category, out of 97 total.
B
C
- Carving width
- Characteristic polynomial of a graph
- Cheeger constant (graph theory)
- Chromatic number
- Chromatic polynomial
- Circuit rank
- Circumference (graph theory)
- Clique number
- Clique-width
- Closeness centrality
- Clustering coefficient
- Colin de Verdière graph invariant
- Conductance (graph)
- Cop number
- Crossing number (graph theory)
- Cutwidth
- Cycle rank
