Interlace polynomials of n-claw graphs

Sarita Nemani, Aihua Li

Research output: Contribution to journalArticleResearchpeer-review

1 Citation (Scopus)

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 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
Volume88
StatePublished - 1 Jan 2014

Fingerprint

Claw
Polynomial
Graph in graph theory
Vertex of a graph
Explicit Formula
Integer

Cite this

@article{fd42f0252cd64a92b324741c4dd462fc,
title = "Interlace polynomials of n-claw graphs",
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 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.",
author = "Sarita Nemani and Aihua Li",
year = "2014",
month = "1",
day = "1",
language = "English",
volume = "88",
pages = "111--122",
journal = "Journal of Combinatorial Mathematics and Combinatorial Computing",
issn = "0835-3026",
publisher = "Charles Babbage Research Centre",

}

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

In: Journal of Combinatorial Mathematics and Combinatorial Computing, Vol. 88, 01.01.2014, p. 111-122.

Research output: Contribution to journalArticleResearchpeer-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 -