Show simple item record

dc.contributor.authorDalfó, Cristina
dc.contributor.authorFiol, Miguel Angel
dc.contributor.authorLópez Lorenzo, Ignacio
dc.date.accessioned2018-12-13T08:42:22Z
dc.date.available2019-04-24T22:08:05Z
dc.date.issued2018-04-04
dc.identifier.issn0364-9024
dc.identifier.urihttp://hdl.handle.net/10459.1/65307
dc.description.abstractMixed 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.
dc.description.sponsorshipThis 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.
dc.format.mimetypeapplication/pdf
dc.language.isoeng
dc.publisherWiley
dc.relationMINECO/PN2013-2016/MTM2013-46949-P
dc.relation.isformatofVersió postprint del document publicat a https://doi.org/10.1002/jgt.22257
dc.relation.ispartofJournal of Graph Theory, 2018, núm. 89, p. 386-394
dc.rights(c) Wiley, 2018
dc.titleOn bipartite-mixed graphs
dc.typeinfo:eu-repo/semantics/article
dc.date.updated2018-12-13T08:42:22Z
dc.identifier.idgrec027831
dc.type.versioninfo:eu-repo/semantics/acceptedVersion
dc.rights.accessRightsinfo:eu-repo/semantics/openAccess
dc.identifier.doihttps://doi.org/10.1002/jgt.22257
dc.subject.udcDegree/diameter problem
dc.subject.udcDiameter
dc.subject.udcMixed graph
dc.subject.udcMoore bound


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record