Abstract
The chromatic polynomial of a simple graph G with n>0 vertices is a polynomial ∑k=1nαk(G)x(x−1)⋯(x−k+1) of degree n, where αk(G) is the number of k-independent partitions of G for all k. The adjoint polynomial of G is defined to be ∑k=1nαk(G¯)xk, where G¯ is the complement of G. We find explicit formulas for the adjoint polynomials of the bridge–path and bridge–cycle graphs. Consequence, we find the zeros of the adjoint polynomials of several families of graphs.
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.
