Abstract
The alliance polynomial of a graph G with order n and maximum degree Δ is the polynomial A(G;x)=∑k=−ΔΔAk(G)xn+k, where Ak(G) is the number of exact defensive k-alliances in G. We obtain some properties of A(G;x) and its coefficients for regular graphs. In particular, we characterize the degree of regular graphs by the number of non-zero coefficients of their alliance polynomial. Besides, we prove that the family of alliance polynomials of Δ-regular graphs with small degree is a very special one, since it does not contain alliance polynomials of graphs which are not Δ-regular. By using this last result and direct computation we find that the alliance polynomial determines uniquely each cubic graph of order less than or equal to 10.
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.
