• A construction of Small (q-1)-Regular Graphs of Girth 8 

      Abreu, Marien; Araujo Pardo, Gabriela; Balbuena Martínez, Maria Camino Teófila; Labbate, D. (2015-04-21)
      Article
      Accés obert
      In this note we construct a new infinite family of (q - 1)-regular graphs of girth 8 and order 2q(q - 1)(2) for all prime powers q >= 16, which are the smallest known so far whenever q - 1 is not a prime power or a prime ...
    • A construction of small regular bipartite graphs of girth 8 

      Balbuena Martínez, Maria Camino Teófila (2009-01)
      Article
      Accés obert
      Let q be a prime a power and k an integer such that 3 ≤ k ≤ q. In this paper we present a method using Latin squares to construct adjacency matrices of k-regular bipartite graphs of girth 8 on $2(kq^{2}-q)$ vertices. Some ...
    • An alternate description of a (q + 1; 8)-cage 

      Abreu, Marien; Araujo Pardo, Gabriela; Balbuena Martínez, Maria Camino Teófila; Labbate, Domenico (2018-12)
      Article
      Accés obert
      Let q >= 2 be a prime power. In this note we present an alternate description of the known (q + 1; 8)-cages which has allowed us to construct small (k; g)–graphs for k =q, q-1, and g = 7; 8 in other papers on this same topic.
    • Incidence matrices of projective planes and of some regular bipartite graphs of girth 6 with few vertices 

      Balbuena Martínez, Maria Camino Teófila (2008-11)
      Article
      Accés obert
      Let q be a prime power and r=0,1...,q−3. Using the Latin squares obtained by multiplying each entry of the addition table of the Galois field of order q by an element distinct from zero, we obtain the incidence matrices ...
    • On a conjecture on the order of cages with a given girth pair 

      Balbuena Martínez, Maria Camino Teófila; Salas, J (2015-08-20)
      Article
      Accés restringit per política de l'editorial
      A (k; g, h)-graph is a k-regular graph of girth pair (g, h) where g is the girth of the graph, h is the length of a smallest cycle of different parity than g and g < h. A (k; g, h)-cage is a (k; g, h)-graph with the least ...
    • Rainbow connectivity of Moore cages of girth 6 

      Balbuena Martínez, Maria Camino Teófila; Fresán Figueroa, J.; González Moreno, Diego; Olsen, Mika (2018-12-11)
      Article
      Accés obert
      Let be an edge-colored graph. A path of is said to be rainbow if no two edges of have the same color. An edge-coloring of is a rainbow-coloring if for any two distinct vertices and of there are at least internally ...
    • Small regular graphs of girth 7 

      Abreu, Marien; Araujo Pardo, Gabriela; Balbuena Martínez, Maria Camino Teófila; Labbate, D.; Salas Salvado, Jordi (2015-07-01)
      Article
      Accés obert
      In this paper, we construct new infinite families of regular graphs of girth 7 of smallest order known so far. Our constructions are based on combinatorial and geometric properties of (q + 1, 8)-cages, for q a prime power. ...