Premium
On bipartite‐mixed graphs
Author(s) -
Dalfó Cristina,
Fiol Miquel Àngel,
López Nacho
Publication year - 2018
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.22257
Subject(s) - bipartite graph , mathematics , combinatorics , mixed graph , context (archaeology) , strong perfect graph theorem , discrete mathematics , chordal graph , 1 planar graph , graph , line graph , voltage graph , paleontology , biology
Mixed graphs can be seen as digraphs that have both arcs and edges (or digons, that is, two opposite arcs). In this article, 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.