Necessary and sufficient conditions for unit graphs to be Hamiltonian (Q627405)

From MaRDI portal





scientific article; zbMATH DE number 5858906
Language Label Description Also known as
English
Necessary and sufficient conditions for unit graphs to be Hamiltonian
scientific article; zbMATH DE number 5858906

    Statements

    Necessary and sufficient conditions for unit graphs to be Hamiltonian (English)
    0 references
    0 references
    0 references
    0 references
    1 March 2011
    0 references
    Given an associative ring \(R\), the unit graph \(G(R)\) has the elements of \(R\) as the vertices and vertices \(x\) and \(y\) are adjacent if \(x + y\) is a unit of \(R\). The following summary result is proved about associative rings and unit graphs. Theorem: Let \(R\) be a ring such that \(R \neq Z_2\) and \(R \neq Z_3\). Then the following are equivalent: {\parindent=6mm \begin{itemize}\item[(a)] The unit graph \(G(R)\) is Hamiltonian. \item[(b)] The ring \(R\) cannot have \(Z_2 \times Z_3\) as a quotient. \item[(c)] The ring \(R\) is generated by its units. \item[(d)] The unit sum number of \(R\) is less than or equal to \(\omega\). \item[(e)] The unit graph \(G(R)\) is connected. \end{itemize}}
    0 references
    Hamiltonian cycle
    0 references
    finite ring
    0 references
    unit graph
    0 references
    0 references

    Identifiers