The binding number of a graph and its pancyclism (Q580376): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 00:41, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The binding number of a graph and its pancyclism |
scientific article |
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
