Loading...
Loading...

Go to the content (press return)

On bipartite-mixed graphs

Author
Dalfo, C.; Fiol, M.; López, N.
Type of activity
Journal article
Journal
Journal of graph theory
Date of publication
2018-04-24
Volume
89
Number
4
First page
386
Last page
394
DOI
https://doi.org/10.1002/jgt.22257 Open in new window
Repository
http://hdl.handle.net/2117/118347 Open in new window
https://arxiv.org/pdf/1611.01618.pdf Open in new window
URL
https://onlinelibrary.wiley.com/doi/full/10.1002/jgt.22257 Open in new window
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 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 ...
Citation
Dalfo, C., Fiol, M., López, N. On bipartite-mixed graphs. "Journal of graph theory", 24 Abril 2018, p. 1-9.
Keywords
Degree/diameter problem, Diameter, Mixed graph, Moore bound
Group of research
COMBGRAPH - Combinatorics, Graph Theory and Applications

Participants