Degree/diameter problem for mixed graphs

View/ Open
Issue date
2015Suggested 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.
Metadata
Show full item recordAbstract
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.
Is part of
Procedia computer science, 2015, vol. 74, p. 2-9European research projects
Collections
Except where otherwise noted, this item's license is described as cc-by-nc-nd (c) López et al., 2015
Related items
Showing items related by title, author, creator and subject.
-
A Moore-like bound for mixed abelian Cayley graphs
López Lorenzo, Ignacio; Pérez Rosés, Hebert; Pujolàs Boix, Jordi (Elsevier B.V., 2016-09-26)We give an upper bound for the number of vertices in mixed abelian Cayley graphs with given degree and diameter. -
A variant of the McKay-Miller-Siran construction for Mixed Graphs
López Lorenzo, Ignacio; Pérez Rosés, Hebert; Pujolàs Boix, Jordi; Zdimalovà, Maria (Elsevier B.V., 2016-09-27)The Degree/Diameter Problem is an extremal problem in graph theory with applications in network design. One of the main research areas in the Degree/Diameter Problem consists of finding large graphs whose order approach ... -
The Degree/Diameter Problem for Mixed Abelian Cayley Graphs
López Lorenzo, Ignacio; Pérez Rosés, Hebert; Pujolàs Boix, Jordi (Elsevier, 2017-11-20)This paper investigates the upper bounds for the number of vertices in mixed abelian Cayley graphs with given degree and diameter. Additionally, in the case when the undirected degree is equal to one, we give a construction ...