Abstract | ||
---|---|---|
Cayley graphs are well known objects with interesting properties, also in the context of Moore graphs and digraphs. In 1978 Bosák 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 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. |
Year | DOI | Venue |
---|---|---|
2014 | 10.1016/j.endm.2014.08.026 | Electronic Notes in Discrete Mathematics |
Keywords | Field | DocType |
Graph,digraph,mixed graph,Moore,Cayley | Discrete mathematics,Indifference graph,Combinatorics,Moore graph,Vertex-transitive graph,Vertex (geometry),Cayley table,Cayley graph,Chordal graph,Mixed graph,Mathematics | Journal |
Volume | ISSN | Citations |
46 | 1571-0653 | 5 |
PageRank | References | Authors |
0.70 | 2 | 3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Nacho López | 1 | 43 | 9.42 |
Hebert Pérez-Rosés | 2 | 5 | 0.70 |
Jordi Pujolàs | 3 | 24 | 5.98 |