Abstract
The dependence polynomial P G = P G ( z ) of a graph G is defined by P G ( z ) ≔ ∑ i = 0 n ( − 1 ) i c i z i where c i = c i ( G ) is the number of complete subgraphs of G of cardinality i . It is clear that the complete subgraphs of G form a poset relative to subset inclusion. Using Möbius inversion, this yields various identities involving dependence polynomials implying in particular that the dependence polynomial of the line graph L ( G ) of G is determined uniquely by the (multiset of) vertex degrees of G and the number of triangles in G . Furthermore, the dependence polynomial of the complement of the line graph of G is closely related to the matching polynomial of G , one of the most ‘prominent’ polynomials studied in graph theory.
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.
