Pith. sign in

REVIEW 1 cited by

Domination Parameters of the Unitary Cayley Graph of $\mathbb{Z}/n\mathbb{Z}$

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1809.04769 v2 pith:N5HSCSFW submitted 2018-09-13 math.CO

classification math.CO
keywords graphsmathbbnumbercayleycompletedirectdominationgraph
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
abstract

The unitary Cayley graph of $\mathbb{Z}/n\mathbb{Z}$, denoted $X_n$, is the graph on $\{0,\dots,n-1\}$ where vertices $a$ and $b$ are adjacent if and only if $\gcd(a-b,n) = 1$. We answer a question of Defant and Iyer by constructing a family of infinitely many integers $n$ such that $\gamma_t(X_n) \leq g(n) - 2$, where $\gamma_t$ denotes the total domination number and $g$ denotes the Jacobsthal function. We determine the irredundance number, domination number, and lower independence number of certain direct products of complete graphs and give bounds for these parameters for any direct product of complete graphs. We provide upper bounds on the size of irredundant sets in direct products of balanced, complete multipartite graphs which are asymptotically correct for the unitary Cayley graphs of integers with a bounded smallest prime factor.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Domination in direct products of complete graphs

    math.CO 2019-08 conditional novelty 7.0 of 10

    For unitary Cayley graphs X_n, the author constructs n with arbitrarily many prime factors satisfying γ_t(X_n) ≤ g(n) - 16, and classifies all products of complete graphs with domination number t+2.

Pith tools