Interlace Polynomials of N-Claw Graphs
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.
MSU Digital Commons Citation
Nemani, Sarita and Li, Aihua, "Interlace Polynomials of N-Claw Graphs" (2014). Department of Mathematics Facuty Scholarship and Creative Works. 95.