IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v10y2022i24p4831-d1008166.html
   My bibliography  Save this article

Entropies Via Various Molecular Descriptors of Layer Structure of H 3 BO 3

Author

Listed:
  • Muhammad Usman Ghani

    (Institute of Mathematics, Khawaja Fareed University of Engineering & Information Technology, Abu Dhabi Road, Rahim Yar Khan 64200, Pakistan
    These authors contributed equally to this work.)

  • Muhammad Kashif Maqbool

    (The Government Sadiq Egerton College Bahwalpur, Punjab 63100, Pakistan
    These authors contributed equally to this work.)

  • Reny George

    (Department of Mathematics, College of Science and Humanities in Al-Kharj, Prince Sattam Bin Abdulaziz University, Al-Kharj 11942, Saudi Arabia
    These authors contributed equally to this work.)

  • Austine Efut Ofem

    (School of Mathematics, Statistics and Computer Science, University of KwaZulu-Natal, Durban 4001, South Africa
    These authors contributed equally to this work.)

  • Murat Cancan

    (Faculty of Education, Yuzuncu Yil University, Van 65080, Turkey
    These authors contributed equally to this work.)

Abstract

Entropy is essential. Entropy is a measure of a system’s molecular disorder or unpredictability, since work is produced by organized molecular motion. Entropy theory offers a profound understanding of the direction of spontaneous change for many commonplace events. A formal definition of a random graph exists. It deals with relational data’s probabilistic and structural properties. The lower-order distribution of an ensemble of attributed graphs may be used to describe the ensemble by considering it to be the results of a random graph. Shannon’s entropy metric is applied to represent a random graph’s variability. A structural or physicochemical characteristic of a molecule or component of a molecule is known as a molecular descriptor. A mathematical correlation between a chemical’s quantitative molecular descriptors and its toxicological endpoint is known as a QSAR model for predictive toxicology. Numerous physicochemical, toxicological, and pharmacological characteristics of chemical substances help to foretell their type and mode of action. Topological indices were developed some 150 years ago as an alternative to the Herculean, and arduous testing is needed to examine these features. This article uses various computational and mathematical techniques to calculate atom–bond connectivity entropy, atom–bond sum connectivity entropy, the newly defined Albertson entropy using the Albertson index, and the IRM entropy using the IRM index. We use the subdivision and line graph of the H 3 B O 3 layer structure, which contains one boron atom and three oxygen atoms to form the chemical boric acid.

Suggested Citation

  • Muhammad Usman Ghani & Muhammad Kashif Maqbool & Reny George & Austine Efut Ofem & Murat Cancan, 2022. "Entropies Via Various Molecular Descriptors of Layer Structure of H 3 BO 3," Mathematics, MDPI, vol. 10(24), pages 1-13, December.
  • Handle: RePEc:gam:jmathe:v:10:y:2022:i:24:p:4831-:d:1008166
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/10/24/4831/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/10/24/4831/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Md. Ashraful Alam & Muhammad Usman Ghani & Muhammad Kamran & Muhammad Shazib Hameed & Riaz Hussain Khan & A. Q. Baig & Hassan Raza, 2022. "Degree-Based Entropy for a Non-Kekulean Benzenoid Graph," Journal of Mathematics, Hindawi, vol. 2022, pages 1-12, June.
    2. Min Hu & Haidar Ali & Muhammad Ahsan Binyamin & Bilal Ali & Jia-Bao Liu & Chengmei Fan & Ghulam Mustafa, 2021. "On Distance-Based Topological Descriptors of Chemical Interconnection Networks," Journal of Mathematics, Hindawi, vol. 2021, pages 1-10, March.
    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. S. Nagarajan & Muhammad Imran & P. Mahesh Kumar & K. Pattabiraman & Muhammad Usman Ghani, 2023. "Degree-Based Entropy of Some Classes of Networks," Mathematics, MDPI, vol. 11(4), pages 1-14, February.

    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. S. Nagarajan & Muhammad Imran & P. Mahesh Kumar & K. Pattabiraman & Muhammad Usman Ghani, 2023. "Degree-Based Entropy of Some Classes of Networks," Mathematics, MDPI, vol. 11(4), pages 1-14, February.

    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:gam:jmathe:v:10:y:2022:i:24:p:4831-:d:1008166. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.