2018
DOI: 10.1007/s12190-018-1168-x
|View full text |Cite
|
Sign up to set email alerts
|

First degree-based entropy of graphs

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
8
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
8
1

Relationship

0
9

Authors

Journals

citations
Cited by 15 publications
(13 citation statements)
references
References 11 publications
0
8
0
Order By: Relevance
“…Ghalavand et al [10] extended some known results about the minimum and maximum values of the degree-based entropy by the following theorem.…”
Section: Preliminariesmentioning
confidence: 96%
See 1 more Smart Citation
“…Ghalavand et al [10] extended some known results about the minimum and maximum values of the degree-based entropy by the following theorem.…”
Section: Preliminariesmentioning
confidence: 96%
“…Ghalavand et al [10] applied majorization technique to extend some known results on the extremal values of the degree-based entropy of trees, unicyclic and bicyclic graphs.…”
Section: Introductionmentioning
confidence: 99%
“…in [8]. Therefore, if we consider the extremal values of I 1 (G) of a class of graphs with given number of edges, it suffices to determine the extremal values…”
Section: Communications In Mathematical and In Computer Chemistrymentioning
confidence: 99%
“…Most of the articles on the Reformulated Zagreb index discuss on the various properties of Reformulated first Zagreb index such as lower and upper bounds [20][21][22][23][24] . Many works are on the computation of the index of various compounds and of certain class of graphs 23,[25][26][27][28][29][30][31][32] . It has been mentioned that, among all the versions of the Zagreb indices, the reformulated first Zagreb index has a significant role in QSPR study 33 .…”
Section: The Reformulated Zagreb Indexmentioning
confidence: 99%