20.500.12556/RUP-22080 On bipartite (1,1,k)-mixed graphs Dvodelni (1,1, k)-mešani grafi 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. mixed graph degree/diameter problem Moore bound bipartite graph mešani graf problem stopnje in premera Moorova meja dvodelni graf true false true Založba Univerze na Primorskem Angleški jezik Slovenski jezik Članek v reviji 2025-11-03 12:53:50 2025-11-03 12:53:50 2025-11-18 03:06:04 0000-00-00 00:00:00 2025 0 0 24 str. no. 3, [article no.] P3.08 Vol. 8 2025 0000-00-00 Zaloznikova Objavljeno NiDoloceno 0000-00-00 0000-00-00 2025-06-16 519.17 2590-9770 10.26493/2590-9770.1728.3f1 ADAM_Dalfó,Erskine,Exoo,Àngel_Fiol,Tuite_2025.pdf ADAM_Dalfó,Erskine,Exoo,Àngel_Fiol,Tuite_2025.pdf 1 19EE9C7C672AE26FAE03D5DF7A4B7017 b6b89d5dfb6e71364c3c90810b2e892bd0d8431b45b0fae07fecfb8f2ad5529b 7c3e8205-b8ac-11f0-8f0b-005056ac49c0 https://repozitorij.upr.si/Dokument.php?lang=slv&id=32025 Založba Univerze na Primorskem 0 0 0