Now showing items 1-2 of 2

    • A Moore-like bound for mixed abelian Cayley graphs 

      López Lorenzo, Ignacio; Pérez Rosés, Hebert; Pujolàs Boix, Jordi (Elsevier B.V., 2016-09-26)
      We give an upper bound for the number of vertices in mixed abelian Cayley graphs with given degree and diameter.
    • Algebraic and computer-based methods in the undirected degree=diameter problem – a brief survey 

      Pérez Rosés, Hebert (Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle (Australia); Institut Teknologi Bandung (ITB) (Indonesia), 2014)
      This paper discusses the most popular algebraic techniques and computational methods that have been used to construct large undirected graphs with given degree and diameter.