IDEAS home Printed from https://ideas.repec.org/a/hin/complx/4646501.html
   My bibliography  Save this article

On Computation and Analysis of Topological Index-Based Invariants for Complex Coronoid Systems

Author

Listed:
  • Muhammad Aamer Rashid
  • Sarfraz Ahmad
  • Muhammad Kamran Siddiqui
  • Mohammed K. A. Kaabar
  • Miaomiao Wang

Abstract

In chemical graph theory, benzenoid systems are interrogated as they exhibit the chemical compounds known as benzenoid hydrocarbons. Benzenoid schemes are circumscribed as planar connected finite graphs having no cut vertices wherein the entire internal sections are collaboratively congruent regular hexagon. The past couple of decennium has acknowledged an extravagant development regarding implementation of information theoretic framework in miscellaneous ramification of science, for instance, in social sciences, biological, physical, and engineering. Explicitly, this tremendous improvement has been outstanding in the field of soft computing, molecular biology, and information technology. The information theory, delineated by Claud Shannon, has no less importance when it was considered. Shannon put forwarded the apprehension of entropy to enumerate upper bounds in transmission rates in telephonic channels, in optical communication, and in wireless. The prestigious feature of entropy is that it entitles the amount of uncertainty in a system. The substantial participation of this paper is to explore characteristics of graph entropies and then keep moving forward to talk about the formation of coronoid polycyclic aromatic hydrocarbons. Likewise, we estimate entropies through precise topological indices established on degree of terminal nodes.

Suggested Citation

  • Muhammad Aamer Rashid & Sarfraz Ahmad & Muhammad Kamran Siddiqui & Mohammed K. A. Kaabar & Miaomiao Wang, 2021. "On Computation and Analysis of Topological Index-Based Invariants for Complex Coronoid Systems," Complexity, Hindawi, vol. 2021, pages 1-12, October.
  • Handle: RePEc:hin:complx:4646501
    DOI: 10.1155/2021/4646501
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/complexity/2021/4646501.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/complexity/2021/4646501.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2021/4646501?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
    ---><---

    More about this item

    Statistics

    Access and download statistics

    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:hin:complx:4646501. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    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.