Carregant...
Carregant...

Vés al contingut (premeu Retorn)

On bipartite-mixed graphs

Autor
Dalfo, C.; Fiol, M.; López, N.
Tipus d'activitat
Article en revista
Revista
Journal of graph theory
Data de publicació
2018-04-24
Pàgina inicial
1
Pàgina final
9
DOI
https://doi.org/10.1002/jgt.22257 Obrir en finestra nova
Repositori
http://hdl.handle.net/2117/118347 Obrir en finestra nova
https://arxiv.org/pdf/1611.01618.pdf Obrir en finestra nova
URL
https://onlinelibrary.wiley.com/doi/full/10.1002/jgt.22257 Obrir en finestra nova
Resum
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
Paraules clau
Degree/diameter problem, Diameter, Mixed graph, Moore bound
Grup de recerca
COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions

Participants