| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 488590 | Procedia Computer Science | 2015 | 8 Pages |
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
