Abstract
For a connected graph of order at least and the Steiner distance among the vertices of is the minimum size among all the connected subgraphs whose vertex sets contain In this paper, we calculate the Steiner distance parameters such as Steiner degree distance, Steiner Gutman index, Steiner Harary index and Steiner reciprocal degree distance of a wheel graphs.
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.
