Partial Petrial polynomials for complete graphs and paths
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866929664997457920 |
|---|---|
| author | Yan, Qi Li, Yuancheng |
| author_facet | Yan, Qi Li, Yuancheng |
| contents | Recently, Gross, Mansour, and Tucker introduced the partial Petrial polynomial, which enumerates all partial Petrials of a ribbon graph by Euler genus. They provided formulas or recursions for various families of ribbon graphs, including ladder ribbon graphs. In this paper, we focus on the partial Petrial polynomial of bouquets, which are ribbon graphs with exactly one vertex. We prove that the partial Petrial polynomial of a bouquet primarily depends on its intersection graph, meaning that two bouquets with identical intersection graphs will have the same partial Petrial polynomial. Additionally, we introduce the concept of the partial Petrial polynomial for circle graphs and prove that for a connected graph with $n$ vertices ($n\geq 2$), the polynomial has non-zero coefficients for all terms of degrees from 1 to $n$ if and only if the graph is complete. Finally, we present the partial Petrial polynomials for paths. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2501_04186 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Partial Petrial polynomials for complete graphs and paths Yan, Qi Li, Yuancheng Combinatorics 05C31, 05C10, 05C30, 57M15 Recently, Gross, Mansour, and Tucker introduced the partial Petrial polynomial, which enumerates all partial Petrials of a ribbon graph by Euler genus. They provided formulas or recursions for various families of ribbon graphs, including ladder ribbon graphs. In this paper, we focus on the partial Petrial polynomial of bouquets, which are ribbon graphs with exactly one vertex. We prove that the partial Petrial polynomial of a bouquet primarily depends on its intersection graph, meaning that two bouquets with identical intersection graphs will have the same partial Petrial polynomial. Additionally, we introduce the concept of the partial Petrial polynomial for circle graphs and prove that for a connected graph with $n$ vertices ($n\geq 2$), the polynomial has non-zero coefficients for all terms of degrees from 1 to $n$ if and only if the graph is complete. Finally, we present the partial Petrial polynomials for paths. |
| title | Partial Petrial polynomials for complete graphs and paths |
| topic | Combinatorics 05C31, 05C10, 05C30, 57M15 |
| url | https://arxiv.org/abs/2501.04186 |