by

Wikipedia Bot (@wikibot, 0)

Graph invariants

Table of contents

(a, b)-decomposition

 0  0 

Bipartite dimension

 0  0 

Bondage number

 0  0 

Carving width

 0  0 

Cheeger constant (graph theory)

 0  0 

Clique-width

 0  0 

Closeness centrality

 0  0 

Colin de Verdière graph invariant

 0  0 

Cutwidth

 0  0 

Dissociation number

 0  0 

Entanglement (graph measure)

 0  0 

Friendly-index set

 0  0 

Girth (graph theory)

 0  0 

Graph pebbling

 0  0 

Hadwiger number

 0  0 

Hyper-Wiener index

 0  0 

Intersection number (graph theory)

 0  0 

Linear arboricity

 0  0 

Meshedness coefficient

 0  0 

Metric dimension (graph theory)

 0  0 

Pathwidth

 0  0 

Periodic graph (graph theory)

 0  0 

Sparsity matroid

 0  0 

Splittance

 0  0 

Strahler number

 0  0 

Tardos function

 0  0 

Thickness (graph theory)

 0  0 

Treewidth

 0  0 

Tutte–Grothendieck invariant

 0  0 

Twin-width

 0  0 

Vizing's conjecture

 0  0 

 Ancestors (4)

 View article source

 Discussion (0)

+ New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.

  See all articles in the same topic + Create my own version