Abstract
Suppose G is a graph with V(G) = {v1, v2, ..., vn}. The eccentricity sequence of G, denoted by e(G), is the set of all e(vi). 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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Journal of Computational and Theoretical Nanoscience
Paper Title
Journal
Date
