1.
On bipartite (1,1,k)-mixed graphsCristina Dalfó,
Grahame Erskine,
Geoffrey Exoo,
Miquel Àngel Fiol,
James Tuite, 2025, original scientific article
Abstract: Mixed graphs can be seen as digraphs that have both arcs and edges (or digons, that is, two opposite arcs). In this paper, we consider the case where such graphs are bipartite and in which the undirected and directed degrees are one. The best graphs, in terms of the number of vertices, are presented for small diameters. Moreover, two infinite families of such graphs with diameter k and number of vertices of the order of 2k/2 are proposed, one of them being totally regular (1,1)-mixed graphs. In addition, we present two more infinite families called chordal ring and chordal double ring mixed graphs, which are bipartite and related to tessellations of the plane. Finally, we give an upper bound that improves the Moore bound for bipartite mixed graphs for r = z = 1.
Keywords: mixed graph, degree/diameter problem, Moore bound, bipartite graph
Published in RUP: 03.11.2025; Views: 283; Downloads: 0
Full text (628,98 KB)
