Now showing items 1-1 of 1

    • Degree diameter problem on honeycomb networks 

      Holub, Přemys; Miller, Mirka; Pérez Rosés, Hebert; Ryan, Joe (Elsevier, 2014-08-23)
      The degree diameter problem involves finding the largest graph (in terms of the number of vertices) subject to constraints on the degree and the diameter of the graph. Beyond the degree constraint there is no restriction ...