On bipartite-mixed graphs
Cita com:
hdl:2117/118347
Tipus de documentArticle
Data publicació2018-04-24
EditorWiley
Condicions d'accésAccés obert
Llevat que s'hi indiqui el contrari, els
continguts d'aquesta obra estan subjectes a la llicència de Creative Commons
:
Reconeixement-NoComercial-SenseObraDerivada 3.0 Espanya
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.
Descripció
This is the peer reviewed version of the following article: Dalfo, C., Fiol, M., López, N. On bipartite-mixed graphs. "Journal of graph theory", 24 Abril 2018, p. 1-9, which has been published in final form at https://onlinelibrary.wiley.com/doi/full/10.1002/jgt.22257. This article may be used for non-commercial purposes in accordance with
Wiley Terms and Conditions for Self-Archiving.
CitacióDalfo, C., Fiol, M., López, N. On bipartite-mixed graphs. "Journal of graph theory", 24 Abril 2018, p. 1-9.
ISSN0364-9024
Versió de l'editorhttps://onlinelibrary.wiley.com/doi/full/10.1002/jgt.22257
Fitxers | Descripció | Mida | Format | Visualitza |
---|---|---|---|---|
Bipartite_mixed ... 16_rev_20_mar_2018_JGT.pdf | 135,9Kb | Visualitza/Obre |