On bipartite-mixed graphs
Mixed graphs can be seen as digraphs that have both arcs and edges (or digons, that is, two opposite arcs). In this arti- cle, 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...
| Autores: | , , |
|---|---|
| Tipo de documento: | artigo |
| Estado: | Versión aceptada para publicación |
| Data de publicação: | 2018 |
| País: | España |
| Recursos: | Universitat de Lleida (UdL) |
| Repositório: | Repositori Obert UdL |
| OAI Identifier: | oai:repositori.udl.cat:10459.1/65307 |
| Acesso em linha: | https://doi.org/10.1002/jgt.22257 http://hdl.handle.net/10459.1/65307 |
| Access Level: | Acceso aberto |
| Palavra-chave: | Degree/diameter problem Diameter Mixed graph Moore bound |
| Resumo: | Mixed graphs can be seen as digraphs that have both arcs and edges (or digons, that is, two opposite arcs). In this arti- cle, 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. |
|---|