graph-invariants
Articles
- Girth (graph theory)Length of a shortest cycle contained in the graph
- Colin de Verdière graph invariantGraph property
- Metric dimension (graph theory)Number of vertices with unambiguous distances
- Dissociation number
- Hadwiger numberSize of largest complete graph made by contracting edges of a given graph
- Colin de Verdière graph invariantGraph property
- Metric dimension (graph theory)Number of vertices with unambiguous distances
- Intersection number (graph theory)Fewest cliques covering a graph's edges
- Closeness centralityInverse sum of distances in a graph
- Entanglement (graph measure)
- Linear arboricity
- Linear arboricity
- Colin de Verdière graph invariantGraph property
- Metric dimension (graph theory)Number of vertices with unambiguous distances
- TreewidthNumber denoting a graph's closeness to a tree
- ArboricityNumber of forests a graph's edges may be partitioned into
- Linear arboricity
- Chromatic polynomialFunction in algebraic graph theory
- Metric dimension (graph theory)Number of vertices with unambiguous distances
- Linear arboricity
- Colin de Verdière graph invariantGraph property
- Metric dimension (graph theory)Number of vertices with unambiguous distances
- Linear arboricity
- Colin de Verdière graph invariantGraph property
- Graph pebblingMathematical game played on a graph
- Girth (graph theory)Length of a shortest cycle contained in the graph
- Girth (graph theory)Length of a shortest cycle contained in the graph
- Girth (graph theory)Length of a shortest cycle contained in the graph
- Girth (graph theory)Length of a shortest cycle contained in the graph
- Clique-widthMeasure of graph complexity
- Cyclomatic numberFewest graph edges whose removal breaks all cycles