On cycles in the sequence of unitary Cayley graphs (Q1827748): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disc.2003.11.013 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2015378916 / rank
 
Normal rank

Revision as of 18:54, 19 March 2024

scientific article
Language Label Description Also known as
English
On cycles in the sequence of unitary Cayley graphs
scientific article

    Statements

    On cycles in the sequence of unitary Cayley graphs (English)
    0 references
    0 references
    0 references
    6 August 2004
    0 references
    The authors prove the following results. (1) Given \(r\in N\), there is \(N(r)\in N\), depending only on \(r\), such that \(p_k(n)=0\) for all \(k\geq N(r)\) and for all \(n\) with at most \(r\) different prime divisors. (2) For every \(r\) there are non-trivial arithmetic functions \(f\) satisfying the following two properties: (i) \(f\) is a \(Z\)-linear combination of multiplicative arithmetic functions, and (ii) \(f(n)=0\) for every \(n\) with at most \(r\) different prime divisors.
    0 references
    Cayley graphs
    0 references
    Induced \(k\)-cycles of a graph
    0 references
    Group of units
    0 references
    Arithmetic functions
    0 references
    Chromatic polynomial uniqueness
    0 references
    0 references

    Identifiers