The binding number of a graph and its pancyclism (Q580376): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: The binding number of a graph and its Anderson number / rank
 
Normal rank
Property / cites work
 
Property / cites work: The binding number of a graph and its triangle / rank
 
Normal rank
Property / cites work
 
Property / cites work: The binding number of a graph and its circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Which rational numbers are binding numbers? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3852212 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3097395 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf02007670 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W70909835 / rank
 
Normal rank

Latest revision as of 11:02, 30 July 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
    0 references

    Identifiers