2008
DOI: 10.3390/ijms9102016
|View full text |Cite
|
Sign up to set email alerts
|

Schultz Index of Armchair Polyhex Nanotubes

Abstract: The study of topological indices -graph invariants that can be used for describing and predicting physicochemical or pharmacological properties of organic compounds -is currently one of the most active research fields in chemical graph theory. In this paper we study the Schultz index and find a relation with the Wiener index of the armchair polyhex nanotubes T U V C 6 [2p, q]. An exact expression for Schultz index of this molecule is also found.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
9
0
1

Year Published

2008
2008
2022
2022

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 7 publications
(10 citation statements)
references
References 21 publications
0
9
0
1
Order By: Relevance
“…Tang et al [49] studied the extremal properties of some distance-based topological indices for trees and unicyclic graphs. For computational study of distance-based topological indices, we refer [3], [6], [7], [16], [23], [51], [52], and [54].…”
Section: B Literature Reviewmentioning
confidence: 99%
“…Tang et al [49] studied the extremal properties of some distance-based topological indices for trees and unicyclic graphs. For computational study of distance-based topological indices, we refer [3], [6], [7], [16], [23], [51], [52], and [54].…”
Section: B Literature Reviewmentioning
confidence: 99%
“…For mathematical as well as chemical meaning and signicance of these topological indices, we refer the reader to papers [3,33,42]. For application of the Szeged and the revised Szeged indices for carbon nanotubes, see for example, [10].…”
Section: It Is Dened Asmentioning
confidence: 99%
“…In the following result, without proof, we give exact analytical expressions for the GA index of certain under-considered polyomino chains. 2n − 3 (12,12) n − 1 2n − 2 (7,12) 2n − 2 2n − 2 (10,10) n − 1 (10,11) 1 (10,12) 2n − 3 (12,12) n − 1 2n − 1 2n + 3 6n − 1 4n − 1 n − 1 Table 19. The edge partition of rn based on degrees of end vertices.…”
Section: Abc(znmentioning
confidence: 99%
See 1 more Smart Citation
“…We encourage the reader to consult the mentioned papers as well as papers by Taeri [33,34] for more information on this subject.…”
Section: Introductionmentioning
confidence: 98%