### Abstract

In this paper, we present the study of the interlace polynomials for n-claw graphs. For a positive integer n > 1, an n-claw graph W_{n} is a tree that has one center vertex and n claws. The center vertex is connected to one vertex of each of the n claws using one edge of the claw. We present iterative formulas and explicit formulas for the interlace polynomial of W _{n}. Furthermore, some interesting properties of the polynomial are discussed.

Original language | English |
---|---|

Pages (from-to) | 111-122 |

Number of pages | 12 |

Journal | Journal of Combinatorial Mathematics and Combinatorial Computing |

Volume | 88 |

State | Published - 1 Jan 2014 |

### Fingerprint

### Cite this

*Journal of Combinatorial Mathematics and Combinatorial Computing*,

*88*, 111-122.

}

*Journal of Combinatorial Mathematics and Combinatorial Computing*, vol. 88, pp. 111-122.

**Interlace polynomials of n-claw graphs.** / Nemani, Sarita; Li, Aihua.

Research output: Contribution to journal › Article › Research › peer-review

TY - JOUR

T1 - Interlace polynomials of n-claw graphs

AU - Nemani, Sarita

AU - Li, Aihua

PY - 2014/1/1

Y1 - 2014/1/1

N2 - In this paper, we present the study of the interlace polynomials for n-claw graphs. For a positive integer n > 1, an n-claw graph Wn is a tree that has one center vertex and n claws. The center vertex is connected to one vertex of each of the n claws using one edge of the claw. We present iterative formulas and explicit formulas for the interlace polynomial of W n. Furthermore, some interesting properties of the polynomial are discussed.

AB - In this paper, we present the study of the interlace polynomials for n-claw graphs. For a positive integer n > 1, an n-claw graph Wn is a tree that has one center vertex and n claws. The center vertex is connected to one vertex of each of the n claws using one edge of the claw. We present iterative formulas and explicit formulas for the interlace polynomial of W n. Furthermore, some interesting properties of the polynomial are discussed.

UR - http://www.scopus.com/inward/record.url?scp=84896375248&partnerID=8YFLogxK

M3 - Article

VL - 88

SP - 111

EP - 122

JO - Journal of Combinatorial Mathematics and Combinatorial Computing

JF - Journal of Combinatorial Mathematics and Combinatorial Computing

SN - 0835-3026

ER -