Category:Graph invariants
Appearance
Wikimedia Commons has media related to Graph invariants.
Graph invariants are properties of graphs that are invariant under graph isomorphisms: each is a function such that whenever and are isomorphic graphs. Examples include the number of vertices and the number of edges.
Pages in category "Graph invariants"
The following 105 pages are in this category, out of 105 total. This list may not reflect recent changes.
B
C
- Carving width
- Characteristic polynomial of a graph
- Cheeger constant (graph theory)
- Chromatic number
- Chromatic polynomial
- Circuit rank
- Circular chromatic number
- Circumference (graph theory)
- Clique number
- Clique-width
- Closeness centrality
- Clustering coefficient
- Colin de Verdière graph invariant
- Conductance (graph theory)
- Connected domination number
- Cop number
- Crossing number (graph theory)
- Cutwidth
- Cycle rank