An improved upper bound for the order of mixed graphs

Thumbnail
View/Open
Issue date
2018
Author
Dalfó, Cristina
Fiol, Miguel Angel
López Lorenzo, Ignacio
Suggested citation
Dalfó, Cristina; Fiol, Miguel Angel; López Lorenzo, Ignacio; . (2018) . An improved upper bound for the order of mixed graphs. Discrete mathematics, october 2018, vol. 341, núm. 10, p. 2872-2877. https://doi.org/10.1016/j.disc.2018.06.016.
Impact

Google Scholar logo  Google Scholar
Share
Export to Mendeley
Metadata
Show full item record
Abstract
A mixed graph G can contain both (undirected) edges and arcs (directed edges). Here we derive an improved Moore-like bound for the maximum number of vertices of a mixed graph with diameter at least three. Moreover, a complete enumeration of all optimal (1; 1)-regular mixed graphs with diameter three
is presented, so proving that, in general, the proposed bound cannot be improved.
URI
http://hdl.handle.net/10459.1/64930
DOI
https://doi.org/10.1016/j.disc.2018.06.016
Is part of
Discrete mathematics, october 2018, vol. 341, núm. 10, p. 2872-2877
Collections