The characteristic polynomials of uniform hypercycles with length four

2023/09/06 by Cunxiang Duan, Duan, Cunxiang, Ligong Wang +3
Computer Science · Engineering · Mathematics · #Combinatorics (math.CO) #Computational Drug Discovery Methods #FOS: Mathematics #Graph theory and applications #Spectral Theory (math.SP) #graph theory and CDMA systems

paper · pdf · doi:10.48550/arxiv.2309.02830

openalex publication_date 2023/09/06 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

Let C_m be a cycle with length m. The k-uniform hypercycle with length m obtained by adding k-2 new vertices in every edge of C_m, denoted by C_m,k. 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.

Related

• The characteristic polynomials of r-uniform hypercycles with length l
• The reduced formula of the characteristic polynomial of hypergraphs and the spectrum of hyperpaths
• Characteristic Polynomial of Certain Hyperplane Arrangements through Graph Theory
• Cycles as edge intersection hypergraphs of k-uniform hypergraphs (k ≤ 6) -- a constructive approach
• Cycles of given lengths in hypergraphs