Algebraic and computer-based methods in the undirected degree=diameter problem – a brief survey
MetadataShow full item record
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.
Is part ofElectronic Journal of Graph Theory and Applications, 2014, vol. 2, núm. 2, p. 166–190
European research projects
The following license files are associated with this item:
Except where otherwise noted, this item's license is described as cc-by-sa (c) Hebert Pérez-Rosés, 2014
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.
Holub, Přemys; Miller, Mirka; Pérez Rosés, Hebert; Ryan, Joe (Elsevier, 2014-08-23)The degree diameter problem involves finding the largest graph (in terms of the number of vertices) subject to constraints on the degree and the diameter of the graph. Beyond the degree constraint there is no restriction ...