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...

Descripción completa

Detalles Bibliográficos
Autores: Dalfó, Cristina, Fiol Mora, Miguel Ángel, López Lorenzo, Ignacio
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
repository_id_str
spelling On bipartite-mixed graphsDalfó, CristinaFiol Mora, Miguel ÁngelLópez Lorenzo, IgnacioDegree/diameter problemDiameterMixed graphMoore boundMixed 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.Wiley2018info:eu-repo/semantics/articleinfo:eu-repo/semantics/acceptedVersionapplication/pdfhttps://doi.org/10.1002/jgt.22257http://hdl.handle.net/10459.1/65307reponame:Repositori Obert UdL instname:Universitat de Lleida (UdL)InglésMINECO/PN2013-2016/MTM2013-46949-PVersió postprint del document publicat a https://doi.org/10.1002/jgt.22257Journal of Graph Theory, 2018, núm. 89, p. 386-394(c) Wiley, 2018info:eu-repo/semantics/openAccessoai:repositori.udl.cat:10459.1/653072026-06-24T12:42:17Z
dc.title.none.fl_str_mv On bipartite-mixed graphs
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
dc.creator.none.fl_str_mv Dalfó, Cristina
Fiol Mora, Miguel Ángel
López Lorenzo, Ignacio
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
dc.subject.none.fl_str_mv Degree/diameter problem
Diameter
Mixed graph
Moore bound
topic 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
dc.date.none.fl_str_mv 2018
dc.type.none.fl_str_mv info:eu-repo/semantics/article
info:eu-repo/semantics/acceptedVersion
format article
status_str acceptedVersion
dc.identifier.none.fl_str_mv https://doi.org/10.1002/jgt.22257
http://hdl.handle.net/10459.1/65307
url https://doi.org/10.1002/jgt.22257
http://hdl.handle.net/10459.1/65307
dc.language.none.fl_str_mv Inglés
language_invalid_str_mv Inglés
dc.relation.none.fl_str_mv MINECO/PN2013-2016/MTM2013-46949-P
Versió postprint del document publicat a https://doi.org/10.1002/jgt.22257
Journal of Graph Theory, 2018, núm. 89, p. 386-394
dc.rights.none.fl_str_mv (c) Wiley, 2018
info:eu-repo/semantics/openAccess
rights_invalid_str_mv (c) Wiley, 2018
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.publisher.none.fl_str_mv Wiley
publisher.none.fl_str_mv Wiley
dc.source.none.fl_str_mv reponame:Repositori Obert UdL
instname:Universitat de Lleida (UdL)
instname_str Universitat de Lleida (UdL)
reponame_str Repositori Obert UdL
collection Repositori Obert UdL
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869412672788758528
score 15,81155

Similares en LA Referencia