title: What is meant by diameter of a network?
body: <p>The diagram shown on <a href="http://en.wikipedia.org/wiki/Vertex_%28graph_theory%29" rel="noreferrer">this link</a> of the "<em>A graph with 6 vertices and 7 edges where the vertex no 6 on the far-left is a leaf vertex or a pendant vertex.</em>" has DIAMETER 4? right or wrong?</p>
  
  <p>Definitions are</p>
  
  <blockquote>
    <p>The diameter of a graph is the maximum
    eccentricity of any vertex in the
    graph. That is, it is the greatest
    distance between any pair of vertices.
    To find the diameter of a graph, first
    find the shortest path between each
    pair of vertices. The greatest length
    of any of these paths is the diameter
    of the graph.</p>
    
    <p>Diameter, D, of a network having N
    nodes is defined as the maximum
    shortest paths between any two nodes
    in the network</p>
    
    <p>Diameter, D, of a network having N
    nodes is defined as the longest path,
    p, of the shortest paths between any
    two nodes D ¼ max (minp[pij length(
    p)). In this equation, pij is the
    length of the path between nodes i and
    j and length (p) is a procedure that
    returns the length of the path, p. For
    example, the diameter of a 4  4 Mesh D
    ¼ 6.</p>
  </blockquote>