Interlace polynomials of n-claw graphs

Sarita Nemani, Aihua Li

Research output: Contribution to journalArticlepeer-review

3 Scopus citations


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.

Original languageEnglish
Pages (from-to)111-122
Number of pages12
JournalJournal of Combinatorial Mathematics and Combinatorial Computing
StatePublished - Feb 2014


Dive into the research topics of 'Interlace polynomials of n-claw graphs'. Together they form a unique fingerprint.

Cite this