dc.contributor.author
López Lorenzo, Ignacio
dc.contributor.author
Pérez Rosés, Hebert
dc.date.accessioned
2024-12-05T21:34:59Z
dc.date.available
2024-12-05T21:34:59Z
dc.date.issued
2016-05-24T12:00:02Z
dc.date.issued
2016-05-24T12:00:02Z
dc.identifier
https://doi.org/10.1016/j.procs.2015.12.066
dc.identifier
http://hdl.handle.net/10459.1/57091
dc.identifier.uri
http://hdl.handle.net/10459.1/57091
dc.description.abstract
The Degree/diameter problem asks for the largest graphs given diameter and maximum degree. This problem has been extensively studied both for directed and undirected graphs, ando also for special classes of graphs. In this work we present the state of art of the degree/diameter problem for mixed graphs.
dc.relation
Reproducció del document publicat a https://doi.org/10.1016/j.procs.2015.12.066
dc.relation
Procedia computer science, 2015, vol. 74, p. 2-9
dc.rights
cc-by-nc-nd (c) López et al., 2015
dc.rights
info:eu-repo/semantics/openAccess
dc.rights
http://creativecommons.org/licenses/by-nc-nd/4.0/
dc.subject
Degree / diameter problem
dc.subject
Mixed Moore graph
dc.subject
Grafs, Teoria de
dc.title
Degree/diameter problem for mixed graphs
