![Sample our Computer Science journals, sign in here to start your access, latest two full volumes FREE to you for 14 days]({"type":"image" , "src" : "/sda/5928/TOC-Subject-Sample-2021-Computer-Science.jpg"})
The domination polynomial of a graph G of order n is the polynomial , where d(G, i) is the number of dominating vertex sets of G with cardinality i. A root of D(G, x) is called a domination root of G. In this paper, we characterize graphs with exactly four distinct domination roots
.
ACM Computing Classification System :
The author would like to express his gratitude to the referees for their careful reading and helpful comments.
Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?
To request a reprint or corporate permissions for this article, please click on the relevant link below:
Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?
Obtain permissions instantly via Rightslink by clicking on the button below:
If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.
