The binding number of a graph and its pancyclism (Q580376)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4016957
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The binding number of a graph and its pancyclism |
scientific article; zbMATH DE number 4016957 |
Statements
The binding number of a graph and its pancyclism (English)
0 references
1987
0 references
The binding number is an important parameter of a graph. The binding number of a graph G, bind (G), is the largest real number c such that \(| N(X)| =\min (c| X|,| V(G)|)\) for every \(X\subseteq V(G).\) In this paper, we prove the Woodall's conjecture: In bind (G)\(\geq 3/2\), then G is pancyclic; and obtain some interesting results.
0 references
binding number
0 references
Woodall's conjecture
0 references
0.8948220014572144
0 references
0.8746460676193237
0 references
0.854377806186676
0 references
0.8155786395072937
0 references
