On the Maximum Estrada Index of 3-Uniform Linear Hypertrees
Joint Authors
Cao, Jinde
Wei, Liang
Hu, Feng
Li, Faxu
Zhao, Haixing
Source
Issue
Vol. 2014, Issue 2014 (31 Dec. 2014), pp.1-7, 7 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2014-08-28
Country of Publication
Egypt
No. of Pages
7
Main Subjects
Medicine
Information Technology and Computer Science
Abstract EN
For a simple hypergraph H on n vertices, its Estrada index is defined as E E ( H ) = ∑ i = 1 n e λ i , 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.
American Psychological Association (APA)
Li, Faxu& Wei, Liang& Cao, Jinde& Hu, Feng& Zhao, Haixing. 2014. On the Maximum Estrada Index of 3-Uniform Linear Hypertrees. The Scientific World Journal،Vol. 2014, no. 2014, pp.1-7.
https://search.emarefa.net/detail/BIM-1050446
Modern Language Association (MLA)
Li, Faxu…[et al.]. On the Maximum Estrada Index of 3-Uniform Linear Hypertrees. The Scientific World Journal No. 2014 (2014), pp.1-7.
https://search.emarefa.net/detail/BIM-1050446
American Medical Association (AMA)
Li, Faxu& Wei, Liang& Cao, Jinde& Hu, Feng& Zhao, Haixing. On the Maximum Estrada Index of 3-Uniform Linear Hypertrees. The Scientific World Journal. 2014. Vol. 2014, no. 2014, pp.1-7.
https://search.emarefa.net/detail/BIM-1050446
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-1050446
