On bipartite mixed graphs

2016/11/05 by Dalfó, C., Fiol, M. A., López, N.
#05C35 #Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.1611.01618

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. As main results, we show that in this context the Moore-like bound is attained in the case of diameter k=3, and that bipartite mixed graphs of diameter k≥ 4 do not exist.

Related

• On bipartite (1,1,k)-mixed graphs
• An improved Moore bound for mixed graphs
• New results on the degree/diameter problem of mixed Abelian Cayley graphs
• On mixed radial Moore graphs of diameter 3
• On total regularity of mixed graphs with order close to the Moore bound