An improved upper bound for the order of mixed graphs
| dc.contributor.author | Dalfó, Cristina | |
| dc.contributor.author | Fiol Mora, Miguel Ángel | |
| dc.contributor.author | López Lorenzo, Ignacio | |
| dc.date.accessioned | 2018-10-19T12:33:11Z | |
| dc.date.issued | 2018 | |
| dc.description.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. | ca_ES |
| dc.description.sponsorship | The research of C. Dalfó has also received funding from the European Union's Horizon 2020 research and innovation programme under the Marie Sk lodowska-Curie grant agreement No 734922. | ca_ES |
| dc.identifier.doi | https://doi.org/10.1016/j.disc.2018.06.016 | |
| dc.identifier.idgrec | 027832 | |
| dc.identifier.issn | 0012-365X | |
| dc.identifier.uri | http://hdl.handle.net/10459.1/64930 | |
| dc.language.iso | eng | ca_ES |
| dc.publisher | Elsevier B.V. | ca_ES |
| dc.relation.isformatof | Versió preprint del document publicat a https://doi.org/10.1016/j.disc.2018.06.016 | ca_ES |
| dc.relation.ispartof | Discrete mathematics, october 2018, vol. 341, núm. 10, p. 2872-2877 | ca_ES |
| dc.relation.projectID | info:eu-repo/grantAgreement/EC/H2020/734922/EU/CONNECT | |
| dc.rights | (c) Elsevier B.V., 2018 | ca_ES |
| dc.rights.accessRights | info:eu-repo/semantics/openAccess | ca_ES |
| dc.subject | Mixed graph | ca_ES |
| dc.subject | Moore bound | ca_ES |
| dc.subject | Network design | ca_ES |
| dc.subject | Degree/diameter problem | ca_ES |
| dc.title | An improved upper bound for the order of mixed graphs | ca_ES |
| dc.type | info:eu-repo/semantics/article | ca_ES |
| dc.type.version | info:eu-repo/semantics/submittedVersion | ca_ES |