8 research outputs found

    Proximity, remoteness and maximum degree in graphs

    Full text link
    The average distance of a vertex vv of a connected graph GG is the arithmetic mean of the distances from vv to all other vertices of GG. The proximity π(G)\pi(G) and the remoteness ρ(G)\rho(G) of GG are the minimum and the maximum of the average distances of the vertices of GG, respectively. In this paper, we give upper bounds on the remoteness and proximity for graphs of given order, minimum degree and maximum degree. Our bounds are sharp apart from an additive constant.Comment: 20 page

    Proximity and Remoteness in Graphs: a survey

    Full text link
    The proximity π=π(G)\pi = \pi (G) of a connected graph GG is the minimum, over all vertices, of the average distance from a vertex to all others. Similarly, the maximum is called the remoteness and denoted by ρ=ρ(G)\rho = \rho (G). The concepts of proximity and remoteness, first defined in 2006, attracted the attention of several researchers in Graph Theory. Their investigation led to a considerable number of publications. In this paper, we present a survey of the research work.Comment: arXiv admin note: substantial text overlap with arXiv:1204.1184 by other author
    corecore