English

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

Combinatorics 2018-12-27 v2

Abstract

The unitary Cayley graph of Z/nZ\mathbb{Z}/n\mathbb{Z}, denoted XnX_n, is the graph on {0,,n1}\{0,\dots,n-1\} where vertices aa and bb are adjacent if and only if gcd(ab,n)=1\gcd(a-b,n) = 1. We answer a question of Defant and Iyer by constructing a family of infinitely many integers nn such that γt(Xn)g(n)2\gamma_t(X_n) \leq g(n) - 2, where γt\gamma_t denotes the total domination number and gg 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.

Keywords

Cite

@article{arxiv.1809.04769,
  title  = {Domination Parameters of the Unitary Cayley Graph of $\mathbb{Z}/n\mathbb{Z}$},
  author = {Amanda Burcroff},
  journal= {arXiv preprint arXiv:1809.04769},
  year   = {2018}
}

Comments

18 pages, 1 figure