Abstract
The reformulated reciprocal degree distance is defined for a connected graph G as Rt‾(G)=12∑u,v∈V(G)(d(u)+d(v))dG(u,v)+t,t≥0. The reformulated reciprocal degree distance is a weight version of the t-Harary index, that is, Ht‾(G)=12∑u,v∈V(G)1dG(u,v)+t,t≥0. In this paper, the reformulated reciprocal degree distance and reciprocal degree distance of the Mycielskian graph and the complement of the Mycielskian graph are obtained.
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.
