Abstract
The Szeged index Sz is a recently introduced graph invariant, having applications in chemistry. In this paper, a formula for the Szeged index of Cartesian product graphs is obtained and some other composite graphs are considered. We also prove that for all connected graphs, Sz is greater than or equal to the sum of distances between all vertices. A conjecture concerning the maximum value of Sz is put forward.
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.
