Abstract
The eccentric connectivity index is a well-known graph invariant defined as the sum of contributions dependent on the eccentricities of adjacent vertices over all edges of a connected graph. Recently, a new variant of the eccentric connectivity index namely multiplicative eccentric connectivity index has been proposed. In this paper, we investigate the behavior of this new invariant under various families of composite graphs. Exact expressions for the values of the multiplicative eccentric connectivity index of sum, disjunction, symmetric difference, lexicographic product, and a special case of strong product, and upper and/or lower bounds for the multiplicative eccentric connectivity index of generalized hierarchical product, Cartesian product, rooted product, corona product, and strong product are presented.
Published Version
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 Discrete Mathematical Sciences and Cryptography
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
