Domination polynomial and total domination polynomial of zero-divisor graphs of commutative rings
Abstract
The domination polynomial (the total domination polynomial) of a graph G of order n is the generating function of the number of dominating sets (total dominating sets) of G of any size. In this paper, we study the domination polynomial and the total domination polynomial of zero-divisor graphs of the ring Zn where n∈ 2p, p2, pq, p2q, pqr, pα , and p, q, r are primes with p>q>r>2 .
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.