2019
DOI: 10.1109/access.2019.2904736
|View full text |Cite
|
Sign up to set email alerts
|

Topological Aspects of Dendrimers via Distance Based Descriptors

Abstract: Distance-based metrics has been practiced to various wide-ranging physicochemical applications, especially in the characterization and modeling of chemical structures. Computational techniques to acquire the precise analytic expressions for a number of distance-based topological indices of inorganic chemical networks and nano-materials are newly growing areas of reticular chemistry. Among these numerical invariants, the eccentricity-based indices are significant for their careful prediction of pharmaceutical p… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
23
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
9

Relationship

5
4

Authors

Journals

citations
Cited by 32 publications
(23 citation statements)
references
References 25 publications
0
23
0
Order By: Relevance
“…where d( f ) represents the degree of an edge and ε( f ) is defined as the largest distance of f with any other edge g in G. This index has been computed for different dendrimer structures in [39][40][41][42]. TIs are descriptors based upon the structure of a compound which brief facts about shape, branching, molecular size, presence of multiple bonds and heteroatoms in the numerical form [1].…”
Section: Methodsmentioning
confidence: 99%
“…where d( f ) represents the degree of an edge and ε( f ) is defined as the largest distance of f with any other edge g in G. This index has been computed for different dendrimer structures in [39][40][41][42]. TIs are descriptors based upon the structure of a compound which brief facts about shape, branching, molecular size, presence of multiple bonds and heteroatoms in the numerical form [1].…”
Section: Methodsmentioning
confidence: 99%
“…For the comprehensive study regarding the various graph descriptors, we refer to refs. [ 22–35 ] . Before we proceed to the main results, the upcoming proposition with the results of the Mostar index and the edge Mostar index for the path graph on l vertices can be easily verified.Proposition Mov()scriptPl=Moe()scriptPl=⌊⌋l122.…”
Section: Introductionmentioning
confidence: 99%
“…For a comprehensive study of different types of topological indices, see [17][18][19][20]24,31,33,36,58,59] and references therein. Throughout this article, all graphs are finite, undirected, and simple.…”
Section: Introductionmentioning
confidence: 99%