Degree/diameter problem for mixed graphs
MetadataShow full item record
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 ofProcedia computer science, 2015, vol. 74, p. 2-9
European research projects
Except where otherwise noted, this item's license is described as cc-by-nc-nd (c) López et al., 2015
Showing items related by title, author, creator and subject.
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 ...
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.
Pérez Rosés, Hebert (Indonesian Combinatorial Society (InaCombS)Graph Theory and Applications (GTA) Research CentreUniversity of Newcastle (Australia)Institut Teknologi Bandung (ITB) (Indonesia), 2014)This paper discusses the most popular algebraic techniques and computational methods that have been used to construct large undirected graphs with given degree and diameter.