Now showing items 1-3 of 3

    • 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 ...
    • Searching for large multi-loop networks 

      Feria Purón, Ramiro; Pérez Rosés, Hebert; Ryan, Joe (Elsevier, 2014)
      We describe and implement a computer-based method to find large multi-loop graphs with given degree and diameter. For some values of degree and diame- ter, our algorithm produces the largest known circulant graphs. We ...
    • Synthetic generation of social network data with endorsements 

      Pérez Rosés, Hebert; Sebé Feixas, Francesc (Palgrave Macmillan, 2014)
      In many simulation studies involving networks there is the need to rely on a sample network to perform the simulation experiments. In many cases, real network data is not available due to privacy concerns. In that case we ...