2013
DOI: 10.1166/jctn.2013.3262
|View full text |Cite
|
Sign up to set email alerts
|

Eccentric Sequences of Two Infinite Classes of Fullerenes

Abstract: The eccentricity sequence of G, denoted by e G , is the set of all e v i . In this paper, the eccentricity sequences of two infinite classes of fullerenes are computed. As a consequence, the eccentric connectivity indices of these fullerenes are computed.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
4
0

Year Published

2015
2015
2016
2016

Publication Types

Select...
3
2

Relationship

1
4

Authors

Journals

citations
Cited by 7 publications
(4 citation statements)
references
References 15 publications
(19 reference statements)
0
4
0
Order By: Relevance
“…These orbits are: (A) [1,19,21,40], (B) [2,3,38,27,8,32,24,18,20,39,35,13], (C) [4,16,26,5,29,17,6,10,22,14,25,36,15,28,7,11,23,33,30,9,31,12,34, 37], (D) [1, 6, 2, 48, 15, 10, 5, 31, 53, 26, 49, 11, 7, 3, 40, 35, 44, 43, 20, 47, 52, 30, 14, 9, 4, 23, [181,197,191,187,221,184,200,186,196,215,225,229,193,218,199,228,195,…”
Section: Computation Detailsmentioning
confidence: 99%
See 1 more Smart Citation
“…These orbits are: (A) [1,19,21,40], (B) [2,3,38,27,8,32,24,18,20,39,35,13], (C) [4,16,26,5,29,17,6,10,22,14,25,36,15,28,7,11,23,33,30,9,31,12,34, 37], (D) [1, 6, 2, 48, 15, 10, 5, 31, 53, 26, 49, 11, 7, 3, 40, 35, 44, 43, 20, 47, 52, 30, 14, 9, 4, 23, [181,197,191,187,221,184,200,186,196,215,225,229,193,218,199,228,195,…”
Section: Computation Detailsmentioning
confidence: 99%
“…Graver 10 presented the catalog of all fullerenes with ten or more symmetries. Some of the present authors [11][12][13][14] computed the symmetries and some distance based topological indices of eight infinite series of fullerenes. In this section, two sequences A n and B n of non-IPR fullerenes with exactly 12 + 24n and 8 + 12n carbon atoms, respectively, are considered into account.…”
Section: Introductionmentioning
confidence: 99%
“…In Ref. [14], the authors continued the pioneering work of Cvetković and Rowlinson to compute the last d + d/2 − 2 in the S-order, among all unicyclic graphs of order n and diameter d. We encourage the interested readers to consult [15][16][17][18] for more information on this topic and [19][20][21][22][23][24] for some infinite classes of fullerenes.…”
Section: Introductionmentioning
confidence: 99%
“…We encourage the interested readers to consult the famous book (Fowler and Manolopoulos 2006) for the mathematical properties of this important class of molecular graphs and (Djafari et al 2013;KoorepazanMoftakhar et al 2014) for more information on this topic.…”
mentioning
confidence: 99%