E-resources
Peer reviewed
Open access
-
Dalfó, C.; Erskine, G.; Exoo, G.; Fiol, M.A.; López, N.; Messegué, A.; Tuite, J.
Discrete Applied Mathematics, 10/2024, Volume: 356Journal Article
An (r,z,k)-mixed graph G has every vertex with undirected degree r, directed in- and out-degree z, and diameter k. In this paper, we study the case r=z=1, proposing some new constructions of (1,1,k)-mixed graphs with a large number of vertices N. Our study is based on computer techniques for small values of k and the use of graphs on alphabets for general k. In the former case, the constructions are either Cayley or lift graphs. In the latter case, some infinite families of (1,1,k)-mixed graphs are proposed with diameter of the order of 2log2N.
