Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 80 tok/s
Gemini 2.5 Pro 49 tok/s Pro
GPT-5 Medium 33 tok/s Pro
GPT-5 High 25 tok/s Pro
GPT-4o 117 tok/s Pro
Kimi K2 176 tok/s Pro
GPT OSS 120B 457 tok/s Pro
Claude Sonnet 4.5 32 tok/s Pro
2000 character limit reached

Domination in direct products of complete graphs (1908.02445v1)

Published 7 Aug 2019 in math.CO

Abstract: Let $X_{n}$ denote the unitary Cayley graph of $\mathbb{Z}/n\mathbb{Z}$. We continue the study of cases in which the inequality $\gamma_t(X_n) \le g(n)$ is strict, where $\gamma_t$ denotes the total domination number, and $g$ is the arithmetic function known as Jacobsthal's function. The best that is currently known in this direction is a construction of Burcroff which gives a family of $n$ with arbitrarily many prime factors that satisfy $\gamma_t(X_n) \le g(n)-2$. We present a new interpretation of the problem which allows us to use recent results on the computation of Jacobsthal's function to construct $n$ with arbitrarily many prime factors that satisfy $\gamma_t(X_n) \le g(n)-16$. We also present new lower bounds on the domination numbers of direct products of complete graphs, which in turn allow us to derive new asymptotic lower bounds on $\gamma(X_n)$, where $\gamma$ denotes the domination number. Finally, resolving a question of Defant and Iyer, we completely classify all graphs $G = \prod_{i=1}t K_{n_i}$ satisfying $\gamma(G) = t+2$.

Summary

We haven't generated a summary for this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.