Degree/diameter problem for mixed graphs

Thumbnail
View/Open
Issue date
2015
Author
López Lorenzo, Ignacio
Pérez Rosés, Hebert
Suggested citation
López Lorenzo, Ignacio; Pérez Rosés, Hebert; . (2015) . Degree/diameter problem for mixed graphs. Procedia computer science, 2015, vol. 74, p. 2-9. https://doi.org/10.1016/j.procs.2015.12.066.
Impact

Google Scholar logo  Google Scholar
Share
Export to Mendeley
Metadata
Show full item record
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.
URI
http://hdl.handle.net/10459.1/57091
DOI
https://doi.org/10.1016/j.procs.2015.12.066
Is part of
Procedia computer science, 2015, vol. 74, p. 2-9
Collections
cc-by-nc-nd (c) López et al., 2015
Except where otherwise noted, this item's license is described as cc-by-nc-nd (c) López et al., 2015