On bipartite‐mixed graphs

From MaRDI portal
Publication:4646945




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 kge4 do not exist.









This page was built for publication: On bipartite‐mixed graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4646945)