Year: 2014
Type: article
Abstract: For a simple hypergraph H on n vertices, its Estrada index is defined as [Formula in text], where λ 1, λ 2,…, λ n are the eigenvalues of its adjacency matrix. In this paper, we determine the unique 3-uniform linear hypertree with the maximum Estrada index.
Source: The Scientific World JOURNAL
DOI: 10.1155/2014/637865
Authors: Faxu Li, Liang Wei, Jinde Cao, Feng Hu, Haixing Zhao
Language: English
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: gold
Estimated APC paid: $860
Funders: National Natural Science Foundation of China, Qinghai Provincial Department of Science and Technology, National Institutes of Health, National Key Research and Development Program of China, National Center for Advancing Translational Sciences, Program for Changjiang Scholars and Innovative Research Team in University
OpenAlex ID: W1975615580