The characteristic polynomials of uniform hypercycles with length four
Cunxiang Duan, Ligong Wang, Yulong Wei

TL;DR
This paper derives trace formulas and characteristic polynomials for 4-length uniform hypercycles, extending spectral graph theory to hypergraphs and providing explicit algebraic expressions for their spectra.
Contribution
It introduces explicit characteristic polynomials for 4-length uniform hypercycles, advancing the spectral analysis of hypergraphs.
Findings
Derived trace formulas for hypercycles of length four
Obtained explicit characteristic polynomials for these hypercycles
Enhanced understanding of spectral properties of uniform hypergraphs
Abstract
Let be a cycle with length The -uniform hypercycle with length obtained by adding new vertices in every edge of denoted by In this paper, we obtain some trace formulas of uniform hypercycles with length four. Moreover, we give the characteristic polynomials of uniform hypercycles with length four.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicsgraph theory and CDMA systems · Computational Drug Discovery Methods · Graph theory and applications
