Mixed Moore Cayley graphs
MetadataShow full item record
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 the so called mixed Moore graphs: those having a unique trail--path? between pairs
of vertices at a distance smaller than or equal to the diameter. In this paper we adapt Cayley's construction to mixed graphs and we show certain mixed Moore graphs are Cayley while some other cannot be Cayley.
Is part ofElectronic Notes in Discrete Mathematics, 2014, vol. 46, p. 193-200
Showing items related by title, author, creator and subject.
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.
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 ...
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 ...