Degree sum conditions for Hamiltonicity on \(k\)-partite graphs (Q1376071)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Degree sum conditions for Hamiltonicity on \(k\)-partite graphs
scientific article

    Statements

    Degree sum conditions for Hamiltonicity on \(k\)-partite graphs (English)
    0 references
    0 references
    0 references
    8 April 1998
    0 references
    This paper provides a result on the Hamiltonicity of a balanced \(k\)-partite graph of order \(kn\) in terms of degree sums of each pair of nonadjacent vertices in different parts. That shows if the sum is greater than \((k-2/(k+1))n\), when \(k\equiv 1\pmod 2\), and \((k-4/(k+2))n\), when \(k\equiv 0\pmod 2\), then the graph is Hamiltonian.
    0 references
    \(k\)-partite graph
    0 references
    Hamiltonicity
    0 references
    degree sum
    0 references
    0 references

    Identifiers