Now showing items 1-11 of 11

    • 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.
    • Connectivity and other invariants of generalized products of graphs 

      López Masip, Susana-Clara; Muntaner Batle, Francesc Antoni (Springer, 2015)
      Figueroa-Centeno et al. [4] introduced the following product of digraphs let D be a digraph and let Γ be a family of digraphs such that V (F) = V for every F∈Γ . Consider any function h:E(D)→Γ . Then the product D⊗hΓ is ...
    • 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 ...
    • Langford sequences and a product of digraphs 

      López Masip, Susana-Clara; Muntaner Batle, Francesc Antoni (Elsevier, 2016)
      Skolem and Langford sequences and their many generalizations have applications in numerous areas. The -product is a generalization of the direct product of digraphs. In this paper we use the -product and super edge-magic ...
    • 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 ...
    • On mixed almost Moore graphs of diameter two 

      López Lorenzo, Ignacio; Miret, Josep M. (Josep Maria) (Electronic Journal of Combinatorics, 2016-04-01)
      Mixed almost Moore graphs appear in the context of the Degree/Diameter problem as a class of extremal mixed graphs, in the sense that their order is one less than the Moore bound for mixed graphs. The problem of their ...
    • Open problems involving super edge-magic labelings and related topics 

      López Masip, Susana-Clara; Muntaner Batle, Francesc Antoni; Rius Font, Miquel (Institute of Combinatorics and its Applications, 2012)
      Graph labelings has experimented a fast development during the last four decades. Two books dedicated to this topic, a very complete survey on the subject and over 1000 papers in the literature constitute a good proof of ...
    • Properties of mixed Moore graphs of directed degree one 

      López Lorenzo, Ignacio; Pujolàs Boix, Jordi (Elsevier, 2015-04-01)
      Mixed graphs of order n such that for any pair of vertices there is a unique trail of length at most k between them are known as mixed Moore graphs. These extremal graphs may only exist for diameter k = 2 and certain ...
    • Rainbow eulerian multidigraphs and the product of cycles 

      López Masip, Susana-Clara; Muntaner Batle, Francesc Antoni (DMTCS, 2016)
      An arc colored eulerian multidigraph with $l$ colors is rainbow eulerian if there is an eulerian circuit in which a sequence of $l$ colors repeats. The digraph product that refers the title was introduced by Figueroa-Centeno ...
    • 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 ...
    • Super edge-magic models 

      López Masip, Susana-Clara; Muntaner Batle, Francesc Antoni; Rius Font, Miquel (Springer, 2011)
      In this paper, we generalize the concept of super edge-magic graph by introducing the new concept of super edge-magic models.