2019
DOI: 10.3390/e21050482
|View full text |Cite
|
Sign up to set email alerts
|

On Properties of Distance-Based Entropies on Fullerene Graphs

Abstract: In this paper, we study several distance-based entropy measures on fullerene graphs. These include the topological information content of a graph I a ( G ) , a degree-based entropy measure, the eccentric-entropy I f σ ( G ) , the Hosoya entropy H ( G ) and, finally, the radial centric information entropy H e c c . We compare these measures on two infinite classes of fullerene graphs denoted by A 12 n + 4 and B 12 n + 6 . We have chosen these measures as… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
6
0
1

Year Published

2020
2020
2024
2024

Publication Types

Select...
7
1

Relationship

1
7

Authors

Journals

citations
Cited by 15 publications
(9 citation statements)
references
References 34 publications
0
6
0
1
Order By: Relevance
“…And most recently, Dehmer and Mowshowitz [26] released an up-to-date overview of graph entropy measurements. It is important to note that other graph entropy measurements have been created; for more information, see [27,28,29,30]. In order to apply a probability distribution to a network, for instance, partitions based on various graph invariants, such as vertices, edges, and distances, have been utilized.…”
Section: Literaturementioning
confidence: 99%
See 1 more Smart Citation
“…And most recently, Dehmer and Mowshowitz [26] released an up-to-date overview of graph entropy measurements. It is important to note that other graph entropy measurements have been created; for more information, see [27,28,29,30]. In order to apply a probability distribution to a network, for instance, partitions based on various graph invariants, such as vertices, edges, and distances, have been utilized.…”
Section: Literaturementioning
confidence: 99%
“…We acquire the second index by having taken the first derivative at κ = 1, after simplifying Eqn. (28).…”
Section: Entropy For Graphene Oxidementioning
confidence: 99%
“…For example, Basak et al introduce bond information content similar to the SIC value [5,43]. Different entropy measures relating to the topological distances in the fullerene [61][62][63][64] and dendrimer graphs [65] also demonstrate usefulness.…”
Section: Figurementioning
confidence: 99%
“…Clearly, the automorphism group of F 16n for n ≥ 3 can be computed similarly. If α denotes the rotation of the F 16n through an angle of 90 • around an axis through the midpoints of the front and back faces, then the corresponding permutation is α = (1, 3, 5, 7) (2, 4, 6, 8)(9, 15, 26, 21) (10,16,27,32) (11,17,28,22) (12,18,29,23) (13,19,30,24) (14,20,31,25) (33,45,41,37) (34,46,42,38) (35,47,43,39) (36,48,44,40). Thus the orbit of the subgroup α is 1 α = {1, 3, 5, 7}.…”
Section: Examplementioning
confidence: 99%