Answers are grounded in this paper and cite their sources.
The eccentricity matrix [Formula: see text] of a connected graph [Formula: see text] is obtained from its distance matrix by retaining precisely those entries that equal the eccentricity of at least one of the corresponding vertices and setting all other entries to zero. This matrix has applications in computational and theoretical chemistry, particularly in molecular structure analysis. Motivated by the ability of hypergraphs to represent complex molecular structures, we investigate the eccentricity matrices of hypercycles. For hypercycles whose hyperedges all have cardinality at least [Formula: see text], we prove that the eccentricity matrix is irreducible and characterize the corresponding eccentric graph. We also establish that the eccentricity matrix of such a hypercycle [Formula: see text] is invertible if and only if [Formula: see text] is [Formula: see text]-uniform, and we determine its rank in the general case. For [Formula: see text]-uniform hypercycles, we obtain explicit determinant formulas for both even and odd lengths and an explicit inverse for odd lengths. Finally, we show that the eccentricity spectrum of a [Formula: see text]-uniform hypercycle of length [Formula: see text], with [Formula: see text], is not symmetric about the origin. When hyperedges of cardinality [Formula: see text] are allowed, we construct a class of non-uniform hypercycles whose eccentricity spectra are symmetric about the origin, owing to the bipartiteness of their eccentric graphs.
No takes yet. Share an insight, caveat, or question.
Sharma et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: