2021
DOI: 10.1016/j.comptc.2021.113142
|View full text |Cite
|
Sign up to set email alerts
|

Graph entropies of porous graphene using topological indices

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
13
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
9

Relationship

2
7

Authors

Journals

citations
Cited by 25 publications
(13 citation statements)
references
References 18 publications
0
13
0
Order By: Relevance
“…In other words, it is the information obtained by learning the values of some unknown variables. Entropy has many applications in information theory as information entropy, in chemistry as thermodynamic entropy, and in graph theory as graph entropy [8][9][10][11][12][13][14][15][16]. In general, entropy is defined as the following: Let x be a discrete random variable and x ∈ X and p be the probability distribution of set X.…”
Section: Introductionmentioning
confidence: 99%
“…In other words, it is the information obtained by learning the values of some unknown variables. Entropy has many applications in information theory as information entropy, in chemistry as thermodynamic entropy, and in graph theory as graph entropy [8][9][10][11][12][13][14][15][16]. In general, entropy is defined as the following: Let x be a discrete random variable and x ∈ X and p be the probability distribution of set X.…”
Section: Introductionmentioning
confidence: 99%
“…Different indices of the same type of nanotubes are also been calculated in References [15,16]. Different novel degree-based topological descriptors of CBT are discussed by Usha et al in References [17][18][19].…”
Section: Tri-hexagonal Bntmentioning
confidence: 99%
“…Simple explicit formulae are developed to predict the geometric arithmetic and atom bond connectivity indices and their expected values in random polyphenyl chains with n hexagons [21]. The weighted graph entropies for the porous graphene structure are analyzed using the first and second Zagreb, Randic and reciprocal Randic, first and fourth atom-bond connectivity, first and fifth geometric arithmetic, harmonic and sum-connectivity indices [22]. The general Randic connection, general Zagreb, general sum connectivity, first, second and multiplicative Zagreb, atom-bond connectivity, and geometric arithmetic indices of horizontal and vertical cylindrical Benes networks are calculated [23].…”
Section: Introductionmentioning
confidence: 99%