Abstract

Let XZ∕nZ denote the unitary Cayley graph of Z∕nZ. We present results on the tightness of the known inequality γ(XZ∕nZ)≤γt(XZ∕nZ)≤g(n), where γ andγt denote the domination number and total domination number, respectively, and g is the arithmetic function known as Jacobsthal’s function. In particular, we construct integers n with arbitrarily many distinct prime factors such that γ(XZ∕nZ)≤γt(XZ∕nZ)≤g(n)−1. We give lower bounds for the domination numbers of direct products of complete graphs and present a conjecture for the exact values of the upper domination numbers of direct products of balanced, complete multipartite graphs.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.