Dependence Polynomials of some Graph Operations

چکیده مقاله

Suppose G is a simple graph and c _k = c _k (G) denotes the number of complete subgraphs of size k in G. Then the dependence polynomial of G is defined as f _G (x) = 1−c₁x+c₂x²−c₃x ³+⋯+(−1)ⁿ xⁿ, 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.