Degree/diameter problem for mixed graphs
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 gra...
| Autores: | , |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2015 |
| País: | España |
| Institución: | Varias* (Consorci de Biblioteques Universitáries de Catalunya, Centre de Serveis Científics i Acadèmics de Catalunya) |
| Repositorio: | Recercat. Dipósit de la Recerca de Catalunya |
| OAI Identifier: | oai:recercat.cat:10459.1/57091 |
| Acceso en línea: | https://doi.org/10.1016/j.procs.2015.12.066 http://hdl.handle.net/10459.1/57091 |
| Access Level: | acceso abierto |
| Palabra clave: | Degree / diameter problem Moore bound Mixed Moore graph Grafs, Teoria de |
| Sumario: | 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. |
|---|