IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v377y2020ics0096300320301132.html
   My bibliography  Save this article

On the r-uniform linear hypertrees with extremal Estrada indices

Author

Listed:
  • Wang, Wen-Huan
  • Xue, Yi-Sai

Abstract

Let H be a hypergraph with n vertices. The Estrada index of H is defined as the sum of eλ1,…,eλn, where λ1,…,λn are the eigenvalues of the adjacency matrix of H. Let Tn,r be the set of r-uniform linear hypertrees with n vertices and Tn,rΔ the subset of Tn,r in which each hypergraph has a largest vertex degree Δ, where r ≥ 3 and 2≤Δ≤(n−1)(r−1). Several new transformations for studying the Estrada indices of hypergraphs are introduced. By these transformations, the hypertree with the smallest Estrada index is determined in Tn,rΔ and the hypertrees with the smallest, the second smallest, the largest, and the second largest Estrada indices are derived among Tn,r.

Suggested Citation

  • Wang, Wen-Huan & Xue, Yi-Sai, 2020. "On the r-uniform linear hypertrees with extremal Estrada indices," Applied Mathematics and Computation, Elsevier, vol. 377(C).
    • Handle: RePEc:eee:apmaco:v:377:y:2020:i:c:s0096300320301132
    DOI: 10.1016/j.amc.2020.125144
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300320301132
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2020.125144?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Estrada, Ernesto & Rodríguez-Velázquez, Juan A., 2006. "Subgraph centrality and clustering in complex hyper-networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 364(C), pages 581-594.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Accominotti, Olivier & Lucena-Piquero, Delio & Ugolini, Stefano, 2023. "Intermediaries’ substitutability and financial network resilience: A hyperstructure approach," Journal of Economic Dynamics and Control, Elsevier, vol. 153(C).
    2. Faxu Li & Hui Xu & Liang Wei & Defang Wang, 2023. "RETRACTED ARTICLE: Identifying vital nodes in hypernetwork based on local centrality," Journal of Combinatorial Optimization, Springer, vol. 45(1), pages 1-13, January.
    3. Chi, Yuxue & Tang, Xianyi & Liu, Yijun, 2022. "Exploring the “awakening effect” in knowledge diffusion: a case study of publications in the library and information science domain," Journal of Informetrics, Elsevier, vol. 16(4).
    4. Xiao Liao & Guangyu Ye & Juan Yu & Yunjiang Xi, 2021. "Identifying lead users in online user innovation communities based on supernetwork," Annals of Operations Research, Springer, vol. 300(2), pages 515-543, May.
    5. Tian, Ru-Ya & Zhang, Xue-Fu & Liu, Yi-Jun, 2015. "SSIC model: A multi-layer model for intervention of online rumors spreading," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 427(C), pages 181-191.
    6. Zhu, Mixin & Zhou, Xiaojun, 2022. "Hypergraph-based joint optimization of spare part provision and maintenance scheduling for serial-parallel multi-station manufacturing systems," Reliability Engineering and System Safety, Elsevier, vol. 225(C).
    7. Yang, Yang & Sun, Peng Gang & Hu, Xia & Li, Zhou Jun, 2014. "Closed walks for community detection," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 397(C), pages 129-143.
    8. Xie, Zheng & Ouyang, Zhenzheng & Li, Jianping, 2016. "A geometric graph model for coauthorship networks," Journal of Informetrics, Elsevier, vol. 10(1), pages 299-311.
    9. Yu, Ping & Wang, Zhiping & Wang, Peiwen & Yin, Haofei & Wang, Jia, 2022. "Dynamic evolution of shipping network based on hypergraph," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 598(C).
    10. Yuan Yuan & Jinli Guo & Zhaohua Guo, 2023. "An Evolutionary Analysis of Higher-Order Interaction Collaborative Innovation Networks in China’s New Energy Vehicle Industry," Sustainability, MDPI, vol. 15(15), pages 1-23, July.
    11. Ma, Xiujuan & Ma, Fuxiang & Yin, Jun & Zhao, Haixing, 2018. "Cascading failures of k uniform hyper-network based on the hyper adjacent matrix," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 510(C), pages 281-289.
    12. Guihai Yu & Renjie Wu & Xingfu Li, 2022. "The Connective Eccentricity Index of Hypergraphs," Mathematics, MDPI, vol. 10(23), pages 1-15, December.
    13. Suo, Qi & Guo, Jin-Li & Shen, Ai-Zhong, 2018. "Information spreading dynamics in hypernetworks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 495(C), pages 475-487.
    14. Yijun Liu & Xiaokun Jin & Yunrui Zhang, 2024. "Identifying risks in temporal supernetworks: an IO-SuperPageRank algorithm," Palgrave Communications, Palgrave Macmillan, vol. 11(1), pages 1-21, December.
    15. Haosen Wang & Qingtao Pan & Jun Tang, 2024. "HEDV-Greedy: An Advanced Algorithm for Influence Maximization in Hypergraphs," Mathematics, MDPI, vol. 12(7), pages 1-18, March.
    16. Youping Fan & Jingjiao Li & Dai Zhang & Jie Pi & Jiahan Song & Guo Zhao, 2019. "Supporting Sustainable Maintenance of Substations under Cyber-Threats: An Evaluation Method of Cybersecurity Risk for Power CPS," Sustainability, MDPI, vol. 11(4), pages 1-30, February.
    17. Wei, Liang & Li, Faxu & Zhao, Haixing & Deng, Bo, 2024. "On the minimum driver node set of k-uniform linear hypertree networks," Applied Mathematics and Computation, Elsevier, vol. 474(C).
    18. Feng Wang & Feng Hu & Rumeng Chen & Naixue Xiong, 2023. "HLEGF: An Effective Hypernetwork Community Detection Algorithm Based on Local Expansion and Global Fusion," Mathematics, MDPI, vol. 11(16), pages 1-17, August.
    19. Abolfazl Hassanpour & Massoud Aman & Alireza Ebrahimi, 2024. "Minimum $$ s-t $$ s - t hypercut in (s, t)-planar hypergraphs," Journal of Combinatorial Optimization, Springer, vol. 48(5), pages 1-22, December.
    20. Xie, Zonglin & Xie, Zheng & Li, Jianping & Yang, Qian, 2018. "Exploring the influence of social activity on scientific career," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 500(C), pages 189-198.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:apmaco:v:377:y:2020:i:c:s0096300320301132. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.