ON DIAMETERS A ! ND RADII OF BRlDGED GRAPHS

  • Hoimdel T Bell Loboratories, New Jersey
  • Published 2001
A graph (I’ is bridged if it contains no isometric cycles of length greater than 3. For each positive integer p, let Tp be the graph obtained by triangulating an equilateral triangIe of side p with equilateral triangles of side 1. It is shown that the radius and diameter of a bridged graph containing no isometric TP satisfy the inequality 6r s 3d +p + 3… (More)