Graph Diameter

Graph Diameter is a metric in graph theory that denotes the longest shortest path length between any pair of vertices in a connected graph, serving as a measure of the graph's overall connectivity and scale.

502

Publications

24.2K

Citations

826

Authors

432

Institutions

Publications per year

2017–2026

62

Authors

826

  1. MA
    Michael A. Henning

    University of Johannesburg, South Africa

    12 publications · 224 citations

    11

    h-index

  2. PD
    Peter Dankelmann

    University of KwaZulu-Natal, South Africa

    13 publications · 267 citations

    11

    h-index

  3. TW
    Teresa W. Haynes

    East Tennessee State University, United States

    8 publications · 181 citations

    8

    h-index

  4. IM
    Ignacio M. Pelayo

    Universitat Politècnica de Catalunya, Spain

    8 publications · 485 citations

    8

    h-index

  5. SL
    Shuchao Li

    Central China Normal University, China

    7 publications · 163 citations

    7

    h-index

1–5 of 826

Venues

  1. Discrete Mathematics

    57 publications · 1.8K citations

    25

    h-index

  2. Discrete Applied Mathematics

    40 publications · 2K citations

    22

    h-index

  3. Linear Algebra and its Applications

    25 publications · 1K citations

    18

    h-index

  4. Journal of Graph Theory

    33 publications · 1.4K citations

    18

    h-index

  5. Journal of Combinatorial Theory Series B

    22 publications · 594 citations

    16

    h-index

1–5