Abstract
The concept of reciprocal degree distance [Formula: see text] of a connected graph [Formula: see text] was introduced in 2012. The Steiner distance in a graph, introduced by Chartrand et al. in 1989, is a natural generalization of the concept of classical graph distance. The [Formula: see text]-center Steiner reciprocal degree distance defined as [Formula: see text], where [Formula: see text] is the Steiner [Formula: see text]-distance of [Formula: see text] and [Formula: see text] is the degree of the vertex [Formula: see text] in [Formula: see text]. Motivated from Zhang’s paper [X. Zhang, Reciprocal Steiner degree distance, Utilitas Math., accepted for publication], we find the expression for [Formula: see text] of complete bipartite graphs. Also, we give a straightforward method to compute Steiner Gutman index and Steiner degree distance of path.
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.
