2000 character limit reached
Domination polynomial of co-maximal graphs of integer modulo ring
Published 9 Mar 2026 in math.CO and cs.DM | (2603.08867v1)
Abstract: We investigate the domination polynomial of the co-maximal graph $Γ(\mathbb{Z}_n)$ related to the ring of integers modulo $n$. Explicit formulas are derived for ( n = p{n_1} ) and ( n = p{n_1}q{n_2} ), demonstrating that the resulting polynomials exhibit unimodality and log-concavity. For general $n$, we present structural expressions that connect $D(Γ(\mathbb{Z}_n),x)$ to appropriate induced subgraphs. Finally, we examine domination roots and establish bounds for their moduli using the Eneström--Kakeya theorem.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.