On bipartite mixed graphs
Combinatorics
2016-11-08 v1
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 , and that bipartite mixed graphs of diameter do not exist.
Keywords
Cite
@article{arxiv.1611.01618,
title = {On bipartite mixed graphs},
author = {C. Dalfó and M. A. Fiol and N. López},
journal= {arXiv preprint arXiv:1611.01618},
year = {2016}
}