The trace and Estrada index of uniform hypergraphs with cut vertices

From MaRDI portal
Publication:2680593

DOI10.1016/J.LAA.2022.12.006zbMATH Open1505.05040arXiv2205.15502OpenAlexW4312055794MaRDI QIDQ2680593FDOQ2680593


Authors: Ya Yang, Chuan-Ming She, Jian Zheng, Hongxia Yang, Yizheng Fan, Yimin Song Edit this on Wikidata


Publication date: 4 January 2023

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Abstract: Let mathcalH be an m-uniform hypergraph, and let mathcalA(mathcalH) be the adjacency tensor of mathcalH which can be viewed as a system of homogeneous polynomials of degree m1. Morozov and Shakirov generalized the traces of linear systems to nonlinear homogeneous polynomial systems and obtained explicit formulas for multidimensional resultants. Sun, Zhou and Bu introduced the Estrada index of uniform hypergraphs which is closely related to the traces of their adjacency tensors. In this paper we give formulas for the traces of mathcalA(mathcalH) when mathcalH contains cut vertices, and obtain results on the traces and Estrada index when mathcalH is perturbed under local changes. We prove that among all hypertrees with fixed number of edges, the hyperpath is the unique one with minimum Estrada index and the hyperstar is the unique one with maximum Estrada index.


Full work available at URL: https://arxiv.org/abs/2205.15502




Recommendations




Cites Work


Cited In (3)





This page was built for publication: The trace and Estrada index of uniform hypergraphs with cut vertices

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