On bipartite‐mixed graphs

From MaRDI portal
Publication:4646945

DOI10.1002/JGT.22257zbMATH Open1402.05088arXiv1611.01618OpenAlexW2964268378MaRDI QIDQ4646945FDOQ4646945


Authors: C. Dalfó, Nacho López, Miquel Angel Fiol Edit this on Wikidata


Publication date: 3 January 2019

Published in: Journal of Graph Theory (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/1611.01618




Recommendations





Cited In (19)





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)