Now showing items 1-6 of 6

    • 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 ...
    • An improved upper bound for the order of mixed graphs 

      Dalfó, Cristina; Fiol, Miguel Angel; López Lorenzo, Ignacio (Elsevier B.V., 2018)
      A mixed graph G can contain both (undirected) edges and arcs (directed edges). Here we derive an improved Moore-like bound for the maximum number of vertices of a mixed graph with diameter at least three. Moreover, a ...
    • 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 ...
    • Network reliability in hamiltonian graphs 

      Llagostera, Pol; López Lorenzo, Ignacio; Comas Rodríguez, Carles (Elsevier, 2021)
      The reliability polynomial of a graph gives the probability that a graph remains operational when all its edges could fail independently with a certain fixed probability. In general, the problem of finding uniformly most ...
    • 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 ...
    • 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 ...