Abstract
In this paper, we present explicit formulas for computing the eccentric-distance sum of the most important graph operations such as the Cartesian product, join, composition, disjunction, symmetric difference, cluster and corona product of graphs. Also, we apply our results to compute this eccentricity-related invariant for some important classes of molecular graphs and nano-structures by specializing components of these graph operations.
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 callDisclaimer: 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.
