The cyclic index of adjacency tensor of generalized power hypergraphs

Abstract

Let $G$ be a $t$-uniform hypergraph, and let $c(G)$ denote the cyclic index of the adjacency tensor of $G$. Let $m,s,t$ be positive integers such that $t\ge 2$, $s\ge 2$ and $m=st$. The generalized power $G^{m,s}$ of $G$ is obtained from $G$ by blowing up each vertex into an $s$-set and preserving the adjacency relation. It was conjectured that $c(G^{m,s})=s\cdot c(G)$. In this paper we show that the conjecture is false by giving a counterexample, and give some sufficient conditions for the conjecture holding. Finally we give an equivalent characterization of the equality in the conjecture by using a matrix equation over ${\mathbb{Z}}_m$.

arXiv commentarXiv admin note: text overlap with arXiv:1704.08799

References in corpus (7)

• Perron-Frobenius theorem for nonnegative multilinear forms and extensions
• On the spectral radius of a class of non-odd-bipartite even uniform hypergraphs
• On some properties of nonnegative weakly irreducible tensors
• The spectral symmetry of weakly irreducible nonnegative tensors and connected hypergraphs
• The $H$-spectrum of a generalized power hypergraph
• Eigenvariety of Nonnegative Symmetric Weakly Irreducible Tensors Associated with Spectral Radius and Its Application to Hypergraphs
• A Combinatorial Method for Computing Characteristic Polynomials of Starlike Hypergraphs

Cited by in corpus (4)

• The trace and Estrada index of uniform hypergraphs with cut vertices
• High-ordered spectral characterization of unicyclic graphs
• The trace of uniform hypergraphs with application to Estrada index
• The spectral property of hypergraph coverings