Domination polynomial of co-maximal graphs of integer modulo ring
Abstract
We investigate the domination polynomial of the co-maximal graph (Zn) related to the ring of integers modulo n. Explicit formulas are derived for \( n = pn1 \) and \( n = pn1qn2 \), demonstrating that the resulting polynomials exhibit unimodality and log-concavity. For general n, we present structural expressions that connect D((Zn),x) to appropriate induced subgraphs. Finally, we examine domination roots and establish bounds for their moduli using the Enestr\"om--Kakeya theorem.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.