Now showing items 1-2 of 2

    • Large digraphs of given diameter and degree from coverings 

      Ždímalová, Mária; Staneková, Lubica (Iniciativa Digital Politècnica, 2011)
      Conference report
      Open Access
      We show that a construction of Comellas and Fiol for large vertex-transitive digraphs of given degree and diameter from small digraphs preserves the properties of being a Cayley digraph and being a regular covering.
    • Large graphs of diameter two and given degree 

      Širáň, Jozef; Siagiová, Jana; Ždímalová, Mária (Iniciativa Digital Politècnica, 2011)
      Conference report
      Open Access
      Let r(d, 2), C(d, 2), and AC(d, 2) be the largest order of a regular graph, a Cayley graph, and a Cayley graph of an Abelian group, respectively, of diameter 2 and degree d. The best currently known lower bounds on these ...