Abstract
The degree distance index (DDI) is a vertex‐degree weighted version of a well‐known index that is called by Wiener index (WI). In extremal theory of graphs, improving the bounds with best possible values is a worth investigating problem. In this note, the exact formulae of the DDI for the four different types of the sum graphs in the terms of various indices of their factor graphs are computed. Moreover, a comparison is also presented between the obtained exact and already existing bounded values for the particular sum graphs.
Sign-in/Register to access full text options 
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.
