| Authors | Z. Shiri and A. R. Ashrafi |
|---|---|
| Journal | Vietnam Journal of Mathematics |
| Page number | 755–769 |
| Serial number | 4 |
| Volume number | 43 |
| Paper Type | Full Paper |
| Published At | 2015 |
| Journal Grade | ISI |
| Journal Type | Typographic |
| Journal Country | Germany |
| Journal Index | Scopus, ISI |
Abstract
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−c1x+c2x2−c3x 3+⋯+(−1)n xn, 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.