id: 05798516
dt: j
an: 05798516
au: Ždímalová, Mária; Staneková, Ľubica
ti: Which Faber-Moore-Chen digraphs are Cayley digraphs?
so: Discrete Math. 310, No. 17-18, 2238-2240 (2010).
py: 2010
pu: Elsevier Science B.V. (North-Holland), Amsterdam
la: EN
cc: 
ut: digraph; degree-diameter problem; Cayley digraph
ci: 
li: doi:10.1016/j.disc.2010.04.020
ab: Summary: The problem of finding the largest graphs and digraphs of given
    degree and diameter is known as the ‘degree-diameter’ problem. One
    of the families of largest known vertex-transitive digraphs of given
    degree and diameter is the Faber-Moore-Chen digraphs. In our
    contribution we will classify those Faber-Moore-Chen digraphs that are
    Cayley digraphs.
rv: