Abstract
Abstract Let G be a simple graph of order n. The domination polynomial of G is the polynomial D ( G , λ ) = ∑ i = 0 n d ( G , i ) λ i , where d(G, i) is the number of dominating sets of G of size i. Every root of D ( G , λ ) is called the domination root of G. We present families of graphs whose their domination polynomial have no nonzero real roots. We observe that these graphs have complex domination roots with positive real part. Then, we consider the lexicographic product of two graphs and obtain a formula for domination polynomial of this product. Finally, we construct a family of graphs which their domination roots are dense in all of C .
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
