The trace of uniform hypergraphs with application to Estrada index

DOI10.1142/S1793830923500659MaRDI QIDQ6413170zbMATH OpenFDO

Authors Yizheng Fan, Jian Zheng, Ya Yang

Publication date 6 October 2022

Full work available at URL https://doi.org/10.1142/S1793830923500659

Mathematics Subject Classification ID

Hypergraphs (05C65) Solving polynomial systems; resultants (13P15) Special varieties (14M99) Multilinear algebra, tensor calculus (15A69)

Abstract: In this paper we investigate the traces of the adjacency tensor of hypergraphs (simply called the traces of hypergraphs). We give new expressions for the traces of hypertrees and linear unicyclic hypergraphs by the weight function assigned to their connected sub-hypergraphs, and provide some perturbation results for the traces of a hypergraph with cut vertices. As applications we determine the unique hypertree with maximum Estrada index among all hypertrees with fixed number of edges and perfect matchings, and the unique unicyclic hypergraph with maximum Estrada index among all unicyclic hypergraph with fixed number of edges and girth $3$.

This page was built for publication: The trace of uniform hypergraphs with application to Estrada index

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6413170)