Document Type
Article
Publication Date
1-1-2023
Journal / Book Title
Electronic Journal of Graph Theory and Applications
Abstract
In this paper, we study the interlace polynomial of a special graph with n vertices, called 4nsnowflake graph. It is similar as the friendship graph Fn of n vertices, which is made of n 3-cycles sharing one center vertex. In stead of 3-cycles, the 4n-snowflake graph Qn is constructed by gluing n 4-cycles to one center vertex. We describe certain properties of such graphs, provide recursive and explicit formulas for the interlace polynomials, and give some properties of such polynomials such as special values and patterns for certain coefficients.
DOI
10.5614/ejgta.2023.11.1.14
MSU Digital Commons Citation
Champanerkar, Jyoti and Li, Aihua, "Interlace polynomials of 4n-snowflake graphs" (2023). Department of Mathematics Faculty Scholarship and Creative Works. 234.
https://digitalcommons.montclair.edu/mathsci-facpubs/234
Rights
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
Published Citation
Champanerkar, J., & Li, A. (2023). Interlace polynomials of 4n-snowflake graphs. Electronic Journal of Graph Theory and Applications, 11(1).