On the eccentricity matrix of hypercycles

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.

Authors

Publication Details

Journal
Journal of Algebra and Its Applications
Published
2026-11-19
DOI
https://doi.org/10.1142/s0219498826440135
Primary Topic
Graph theory and applications
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

On the eccentricity matrix of hypercycles

K. Sharma, S.K. Panda
Journal of Algebra and Its Applications
Graph theory and applications
article

On the eccentricity matrix of hypercycles

K. Sharma, S.K. Panda
article en

Abstract

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.

Journal of Algebra and Its Applications
Graph theory and applications
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon