The Connective Eccentricity Index of Hypergraphs

Guihai Yu (), Renjie Wu and Xingfu Li
Additional contact information
Guihai Yu: College of Big Data Statistics, Guizhou University of Finance and Economics, Guiyang 550025, China
Renjie Wu: College of Big Data Statistics, Guizhou University of Finance and Economics, Guiyang 550025, China
Xingfu Li: College of Big Data Statistics, Guizhou University of Finance and Economics, Guiyang 550025, China

Mathematics, 2022, vol. 10, issue 23, 1-15

Abstract: The connective eccentricity index (CEI) of a hypergraph G is defined as ξ c e ( G ) = ∑ v ∈ V ( G ) d G ( v ) ε G ( v ) , where ε G ( v ) and d G ( v ) denote the eccentricity and the degree of the vertex v , respectively. In this paper, we determine the maximal and minimal values of the connective eccentricity index among all k -uniform hypertrees on n vertices and characterize the corresponding extremal hypertrees. Finally, we establish some relationships between the connective eccentricity index and the eccentric connectivity index of hypergraphs.

Keywords: connective eccentricity index; k -uniform hypertrees; hypergraphs; maximal and minimal values (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2022
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/10/23/4574/pdf (application/pdf)
https://www.mdpi.com/2227-7390/10/23/4574/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:10:y:2022:i:23:p:4574-:d:991786

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().