Abstract
Let G = ( V , E ) be a connected graph on n vertices. Denote by l - ( G ) the average distance between all pairs of vertices in G . The remoteness ρ ( G ) of a connected graph G is the maximum average distance from a vertex of G to all others. The aim of this paper is to show that two conjectures in [1] concerned with average distance, radius and remoteness of a graph are true. [1] M. Aouchiche and P. Hansen, Proximity and remoteness in graphs: results and conjectures, Networks 58 (2011), 95 – 102.
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.
