Estrada index and subgraph centrality of hypergraphs via tensors
Combinatorics
2023-07-12 v2
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 -uniform hypergraph 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 . When is -uniform, the above Estrada index and subgraph centrality are the Estrada index and subgraph centrality of a graph.
Keywords
Cite
@article{arxiv.2107.03837,
title = {Estrada index and subgraph centrality of hypergraphs via tensors},
author = {Hong Zhou and Lizhu Sun and Changjiang Bu},
journal= {arXiv preprint arXiv:2107.03837},
year = {2023}
}