To access the full text documents, please follow this link: http://hdl.handle.net/2117/119636
dc.contributor | Universitat Politècnica de Catalunya. Departament de Matemàtiques |
---|---|
dc.contributor | Universitat Politècnica de Catalunya. COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions |
dc.contributor.author | Dalfó Simó, Cristina |
dc.contributor.author | Fiol Mora, Miquel Àngel |
dc.contributor.author | López Lorenzo, Nacho |
dc.date | 2018-07 |
dc.identifier.citation | Dalfo, C., Fiol, M., López, N. An improved upper bound for the order of mixed graphs. "Discrete mathematics", Juliol 2018, vol. 341, núm. 10, p. 2872-2877. |
dc.identifier.citation | 0012-365X |
dc.identifier.citation | https://arxiv.org/pdf/1610.00116.pdf |
dc.identifier.citation | 10.1016/j.disc.2018.06.016 |
dc.identifier.uri | http://hdl.handle.net/2117/119636 |
dc.language.iso | eng |
dc.relation | https://www.sciencedirect.com/science/article/pii/S0012365X18301870 |
dc.rights | Attribution-NonCommercial-NoDerivs 3.0 Spain |
dc.rights | info:eu-repo/semantics/openAccess |
dc.rights | http://creativecommons.org/licenses/by-nc-nd/3.0/es/ |
dc.subject | Àrees temàtiques de la UPC::Matemàtiques i estadística::Matemàtica discreta::Teoria de grafs |
dc.subject | Graph theory |
dc.subject | Mixed graph |
dc.subject | Moore bound |
dc.subject | Network design |
dc.subject | Degree/diameter problem |
dc.subject | Grafs, Teoria de |
dc.title | An improved upper bound for the order of mixed graphs |
dc.type | info:eu-repo/semantics/submittedVersion |
dc.type | info:eu-repo/semantics/article |
dc.description.abstract |