Estrada index and subgraph centrality of hypergraphs via tensors

2021/07/08 by Zhou, Hong, Sun, Lizhu, Bu, Changjiang · 4 citations
#Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.2107.03837

Abstract

Uniform hypergraphs have a natural one-to-one correspondence to tensors. In this paper, we investigate the Estrada index and subgraph centrality of an m-uniform hypergraph H via the adjacency tensor. We establish some bounds for the Estrada index and give expressions of the subgraph centrality in terms of graph parameters of the multi-digraphs associated with H. When H is 2-uniform, the above Estrada index and subgraph centrality are the Estrada index and subgraph centrality of a graph.

Cited by

• Stochastic Trace and Diagonal Estimator for Tensors
• Perron-Frobenius theorem for dual tensors and its applications
• The ordering of hypertrees and unicyclic hypergraphs by the traces of A_α-tensor
• An α-triangle eigenvector centrality of graphs

Related

• The trace of uniform hypergraphs with application to Estrada index
• Signless Laplacian Estrada index and Laplacian Estrada index of uniform hypergraphs
• Adjacency and Tensor Representation in General Hypergraphs Part 1: e-adjacency Tensor Uniformisation Using Homogeneous Polynomials
• Adjacency and Tensor Representation in General Hypergraphs.Part 2: Multisets, Hb-graphs and Related e-adjacency Tensors
• Three hypergraph eigenvector centralities