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 recurso: | artículo |
| Estado: | Versión aceptada para publicación |
| Fecha de publicación: | 2018 |
| País: | España |
| Institución: | Universitat de Lleida (UdL) |
| Repositorio: | Repositori Obert UdL |
| OAI Identifier: | oai:repositori.udl.cat:10459.1/65307 |
| Acceso en línea: | https://doi.org/10.1002/jgt.22257 http://hdl.handle.net/10459.1/65307 |
| Access Level: | acceso abierto |
| Palabra clave: | Degree/diameter problem Diameter Mixed graph Moore bound |
| id |
ES_8a0ec31af2d4f552cb7aabb6283b693f |
|---|---|
| oai_identifier_str |
oai:repositori.udl.cat:10459.1/65307 |
| network_acronym_str |
ES |
| network_name_str |
España |
| spelling |
On bipartite-mixed graphs Dalfó, Cristina Fiol Mora, Miguel Ángel López Lorenzo, Ignacio Degree/diameter problem Diameter Mixed graph Moore bound 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. This research have been partially supported by AGAUR under project 2017SGR1087 (C. D. and M.A. F.). The author N. L. has been supported in part by grant MTM2013-46949-P, from Ministerio de Economía y Competitividad, Spain. Wiley https://doi.org/10.1002/jgt.22257 http://hdl.handle.net/10459.1/65307 |
| title |
On bipartite-mixed graphs |
| spellingShingle |
On bipartite-mixed graphs Dalfó, Cristina Degree/diameter problem Diameter Mixed graph Moore bound |
| title_short |
On bipartite-mixed graphs |
| title_full |
On bipartite-mixed graphs |
| title_fullStr |
On bipartite-mixed graphs |
| title_full_unstemmed |
On bipartite-mixed graphs |
| title_sort |
On bipartite-mixed graphs |
| author |
Dalfó, Cristina |
| author_facet |
Dalfó, Cristina Fiol Mora, Miguel Ángel López Lorenzo, Ignacio |
| author_role |
author |
| author2 |
Fiol Mora, Miguel Ángel López Lorenzo, Ignacio |
| author2_role |
author author |
| topic |
Degree/diameter problem Diameter Mixed graph Moore bound |
| topic_facet |
Degree/diameter problem Diameter Mixed graph Moore bound |
| description |
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. |
| publishDate |
2018 |
| format |
article |
| status_str |
acceptedVersion |
| url |
https://doi.org/10.1002/jgt.22257 http://hdl.handle.net/10459.1/65307 |
| eu_rights_str_mv |
openAccess |
| publisher |
Wiley |
| institution |
Universitat de Lleida (UdL) |
| collection |
Repositori Obert UdL |
| reponame_str |
Repositori Obert UdL |
| instname_str |
Universitat de Lleida (UdL) |
| _version_ |
1878736158766137344 |
| publishDateSort |
2018 |
| author_browse |
Dalfó, Cristina Fiol Mora, Miguel Ángel López Lorenzo, Ignacio |
| publisherStr |
Wiley |
| score |
6.9008884 |