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

Hosoya entropy of fullerene graphs

Author

Listed:
  • Ghorbani, Modjtaba
  • Dehmer, Matthias
  • Rajabi-Parsa, Mina
  • Emmert-Streib, Frank
  • Mowshowitz, Abbe

Abstract

Entropy-based methods are useful tools for investigating various problems in mathematical chemistry, computational physics and pattern recognition. In this paper we introduce a general framework for applying Shannon entropy to fullerene graphs, and used it to investigate their properties. We show that important physical properties of these molecules can be determined by applying Hosoya entropy to their corresponding graphs.

Suggested Citation

  • Ghorbani, Modjtaba & Dehmer, Matthias & Rajabi-Parsa, Mina & Emmert-Streib, Frank & Mowshowitz, Abbe, 2019. "Hosoya entropy of fullerene graphs," Applied Mathematics and Computation, Elsevier, vol. 352(C), pages 88-98.
    • Handle: RePEc:eee:apmaco:v:352:y:2019:i:c:p:88-98
    DOI: 10.1016/j.amc.2019.01.024
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300319300335
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2019.01.024?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. Cao, Shujuan & Dehmer, Matthias, 2015. "Degree-based entropies of networks revisited," Applied Mathematics and Computation, Elsevier, vol. 261(C), pages 141-147.
    2. Cao, Shujuan & Dehmer, Matthias & Kang, Zhe, 2017. "Network Entropies Based on Independent Sets and Matchings," Applied Mathematics and Computation, Elsevier, vol. 307(C), pages 265-270.
    3. Dehmer, Matthias & Emmert-Streib, Frank & Shi, Yongtang, 2015. "Graph distance measures based on topological indices revisited," Applied Mathematics and Computation, Elsevier, vol. 266(C), pages 623-633.
    4. Matthias Dehmer & Abbe Mowshowitz & Frank Emmert-Streib, 2011. "Connections between Classical and Parametric Network Entropies," PLOS ONE, Public Library of Science, vol. 6(1), pages 1-8, January.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Modjtaba Ghorbani & Matthias Dehmer & Frank Emmert-Streib, 2020. "Properties of Entropy-Based Topological Measures of Fullerenes," Mathematics, MDPI, vol. 8(5), pages 1-23, May.
    2. Modjtaba Ghorbani & Razie Alidehi-Ravandi & Matthias Dehmer & Frank Emmert-Streib, 2023. "A Study of Roots of a Certain Class of Counting Polynomials," Mathematics, MDPI, vol. 11(13), pages 1-14, June.
    3. Maryam Jalali-Rad & Modjtaba Ghorbani & Matthias Dehmer & Frank Emmert-Streib, 2021. "Orbit Entropy and Symmetry Index Revisited," Mathematics, MDPI, vol. 9(10), pages 1-13, May.
    4. Ghorbani, Modjtaba & Alidehi-Ravandi, Razie & Dehmer, Matthias, 2024. "Fullerenes via their counting polynomials," Applied Mathematics and Computation, Elsevier, vol. 466(C).
    5. Ghorbani, Modjtaba & Hakimi-Nezhaad, Mardjan & Dehmer, Matthias, 2022. "Novel results on partial hosoya polynomials: An application in chemistry," Applied Mathematics and Computation, Elsevier, vol. 433(C).

    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. Ma, Yuede & Cao, Shujuan & Shi, Yongtang & Dehmer, Matthias & Xia, Chengyi, 2019. "Nordhaus–Gaddum type results for graph irregularities," Applied Mathematics and Computation, Elsevier, vol. 343(C), pages 268-272.
    2. Modjtaba Ghorbani & Matthias Dehmer & Frank Emmert-Streib, 2020. "Properties of Entropy-Based Topological Measures of Fullerenes," Mathematics, MDPI, vol. 8(5), pages 1-23, May.
    3. Ghorbani, Modjtaba & Dehmer, Matthias & Zangi, Samaneh, 2018. "Graph operations based on using distance-based graph entropies," Applied Mathematics and Computation, Elsevier, vol. 333(C), pages 547-555.
    4. Knor, Martin & Škrekovski, Riste & Tepeh, Aleksandra, 2016. "Digraphs with large maximum Wiener index," Applied Mathematics and Computation, Elsevier, vol. 284(C), pages 260-267.
    5. Yu, Guihai & Qu, Hui, 2018. "The coefficients of the immanantal polynomial," Applied Mathematics and Computation, Elsevier, vol. 339(C), pages 38-44.
    6. Wen, Tao & Jiang, Wen, 2018. "An information dimension of weighted complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 501(C), pages 388-399.
    7. Chen, Zengqiang & Dehmer, Matthias & Shi, Yongtang, 2015. "Bounds for degree-based network entropies," Applied Mathematics and Computation, Elsevier, vol. 265(C), pages 983-993.
    8. Wang, Juan & Li, Chao & Xia, Chengyi, 2018. "Improved centrality indicators to characterize the nodal spreading capability in complex networks," Applied Mathematics and Computation, Elsevier, vol. 334(C), pages 388-400.
    9. Dingyi Gan & Bin Yang & Yongchuan Tang, 2020. "An Extended Base Belief Function in Dempster–Shafer Evidence Theory and Its Application in Conflict Data Fusion," Mathematics, MDPI, vol. 8(12), pages 1-19, December.
    10. Lavanya Sivakumar & Matthias Dehmer, 2012. "Towards Information Inequalities for Generalized Graph Entropies," PLOS ONE, Public Library of Science, vol. 7(6), pages 1-14, June.
    11. Wan, Pengfei & Tu, Jianhua & Zhang, Shenggui & Li, Binlong, 2018. "Computing the numbers of independent sets and matchings of all sizes for graphs with bounded treewidth," Applied Mathematics and Computation, Elsevier, vol. 332(C), pages 42-47.
    12. Yu, Guihai & Li, Xingfu, 2020. "Connective Steiner 3-eccentricity index and network similarity measure," Applied Mathematics and Computation, Elsevier, vol. 386(C).
    13. Lan, Yongxin & Li, Tao & Ma, Yuede & Shi, Yongtang & Wang, Hua, 2018. "Vertex-based and edge-based centroids of graphs," Applied Mathematics and Computation, Elsevier, vol. 331(C), pages 445-456.
    14. Wan, Pengfei & Tu, Jianhua & Dehmer, Matthias & Zhang, Shenggui & Emmert-Streib, Frank, 2019. "Graph entropy based on the number of spanning forests of c-cyclic graphs," Applied Mathematics and Computation, Elsevier, vol. 363(C), pages 1-1.
    15. Carlos F Alvarez & Luis E Palafox & Leocundo Aguilar & Mauricio A Sanchez & Luis G Martinez, 2016. "Using Link Disconnection Entropy Disorder to Detect Fast Moving Nodes in MANETs," PLOS ONE, Public Library of Science, vol. 11(5), pages 1-15, May.
    16. Ilić, Aleksandar & Ilić, Milovan, 2017. "Counterexamples to conjectures on graph distance measures based on topological indexes," Applied Mathematics and Computation, Elsevier, vol. 296(C), pages 148-152.
    17. Ghorbani, Modjtaba & Hakimi-Nezhaad, Mardjan & Dehmer, Matthias, 2022. "Novel results on partial hosoya polynomials: An application in chemistry," Applied Mathematics and Computation, Elsevier, vol. 433(C).
    18. Ni, Chengzhang & Yang, Jun & Kong, Demei, 2020. "Sequential seeding strategy for social influence diffusion with improved entropy-based centrality," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 545(C).
    19. Mikołaj Morzy & Tomasz Kajdanowicz & Przemysław Kazienko, 2017. "On Measuring the Complexity of Networks: Kolmogorov Complexity versus Entropy," Complexity, Hindawi, vol. 2017, pages 1-12, November.
    20. Das, Kinkar Ch. & Gutman, Ivan & Nadjafi–Arani, Mohammad J., 2015. "Relations between distance–based and degree–based topological indices," Applied Mathematics and Computation, Elsevier, vol. 270(C), pages 142-147.

    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:352:y:2019:i:c:p:88-98. 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.