Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2508.14865

On the generator graph of a cyclic group

Zekhaya B. Shozi·Teresa L. Tacbobo
View original source ↗Read source document ↗Export metadata ↓

Abstract

In this paper, we continue the study of the generator graph of a group. In 2023, Tacbobo [9] defined the generator graph of a nontrivial group to be the graph whose vertices are the elements of the group, with two vertices being adjacent if at least one of them is a generator of the group. Building on the properties established in [9], we prove that the diameter of the generator graph of a cyclic group is at most $2$. Furthermore, we present explicit formulas for some topological indices of the generator graph of a cyclic group with $n \ge 2$ elements and whose set of generators is $S$, expressed in terms of $n$ and $|S|$. Lastly, we determine the metric dimension of the generator graph of a nontrivial cyclic group as a function of its order $n$.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Zekhaya B. Shozi, Teresa L. Tacbobo. 2025-08-20. On the generator graph of a cyclic group. https://arxiv.org/abs/2508.14865

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO↗
arXiv2026

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO↗