Now showing items 1-10 of 10

    • 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.
    • A variant of the McKay-Miller-Siran construction for Mixed Graphs 

      López Lorenzo, Ignacio; Pérez Rosés, Hebert; Pujolàs Boix, Jordi; Zdimalovà, Maria (Elsevier B.V., 2016-09-27)
      The Degree/Diameter Problem is an extremal problem in graph theory with applications in network design. One of the main research areas in the Degree/Diameter Problem consists of finding large graphs whose order approach ...
    • 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.
    • 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 ...
    • Degree/diameter problem for mixed graphs 

      López Lorenzo, Ignacio; Pérez Rosés, Hebert (Elsevier, 2015)
      The Degree/diameter problem asks for the largest graphs given diameter and maximum degree. This problem has been extensively studied both for directed and undirected graphs, ando also for special classes of graphs. In this ...
    • Endorsement deduction and ranking in social networks 

      Pérez Rosés, Hebert; Sebé Feixas, Francesc; Ribó i Balust, Josep M. (Josep Maria) (Elsevier, 2016)
      Some social networks, such as LinkedIn and ResearchGate, allow user endorsements for specific skills. In this way, for each skill we get a directed graph where the nodes correspond to users’ profiles and the arcs represent ...
    • Mixed Moore Cayley graphs 

      López Lorenzo, Ignacio; Pérez Rosés, Hebert; Pujolàs Boix, Jordi (Elsevier, 2014-09-01)
      Cayley graphs are well known objects with interesting properties, also in the context of Moore graphs and digraphs. In $1978$ Bos\'ak extended Moore's property to the mixed setting (with arcs allowed along with edges), in ...
    • 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 ...
    • The Degree/Diameter Problem for Mixed Abelian Cayley Graphs 

      López Lorenzo, Ignacio; Pérez Rosés, Hebert; Pujolàs Boix, Jordi (Elsevier, 2017-11-20)
      This paper investigates the upper bounds for the number of vertices in mixed abelian Cayley graphs with given degree and diameter. Additionally, in the case when the undirected degree is equal to one, we give a construction ...