论文标题
均匀的超图的痕迹，并应用于埃斯特拉达指数
The trace of uniform hypergraphs with application to Estrada index
论文作者
论文摘要
在本文中，我们研究了HyperGraphs的邻接张量的痕迹（简单地称为HyperGraphs的痕迹）。我们通过分配给其连接的子毛图的重量函数为超树和线性独立超图的痕迹提供了新的表达式，并为带有切割的顶点的超图的痕迹提供了一些扰动结果。作为应用程序，我们确定所有具有固定数量的边缘和完美匹配的大型埃斯特拉达索引的独特雌激素，以及在所有Unicyclic HyperGraph中具有最大estrada索引的独特的Unicyclic HyperGraph，带有固定数量的边缘和Girth $ 3 $。
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$.
