Document Type : Original Research Article
Authors
- Farkhanda Afzal ^{} ^{} ^{1}
- Sidra Razaq ^{2}
- Mehmoona Abdul Razaq ^{3}
- Murat Cancan ^{} ^{4}
- Mehmet Serif Aldemir ^{} ^{5}
^{1} MCS, National University of Sciences and Technology, Islamabad, Pakistan
^{2} Department of Mathematics, Lahore College for Women University, Jhang Campus, Jhang, Pakistan
^{3} Department of Mathematics and Statistics, The University of Lahore, Lahore, Pakistan
^{4} Faculty of Education, Van Yüzüncü Yıl University, Van, Turkey
^{5} Faculty of Science, Van Yüzüncü Yıl University, Van, Turkey
Abstract
The entropy of a graph is a functional depending both on the graph itself and on a probability distribution on its vertex set. This graph functional originated from the problem of source coding in information theory and was introduced by J. Krner in 1973. Although the notion of graph entropy has its roots in information theory, it was proved to be closely related to some classical and frequently studied graph theoretic concepts. In this article, we obtained the graph entropy with Randić, geometric-arithmetic, harmonic, first Zagreb, second Zagreb, atom bond connectivity, sum connectivity index and augmented Zagreb indices for Zig-Zag chain of 8-cycles molecular graph.
Graphical Abstract
Keywords
Main Subjects