Abstract
Suppose G is a simple graph and ck = ck(G) denotes the number of complete subgraphs of size k in G. Then the dependence polynomial of G is defined as fG(x) = 1−c1x+c2x2−c3x3+⋯+(−1)nxn, where n is the size of the largest complete subgraph in G. In this paper, exact formulas for dependence polynomial of some graph operations are presented.
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.
