Show simple item record

dc.contributor.authorLópez Lorenzo, Ignacio
dc.contributor.authorPérez Rosés, Hebert
dc.contributor.authorPujolàs Boix, Jordi
dc.contributor.authorZdimalovà, Maria
dc.description.abstractThe 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 theoretical upper bounds as much as possible. In the case of directed graphs there exist some families that come close to the theoretical upper bound asymptotically. In the case of undirected graphs there also exist some good constructions for specific values of the parameters involved (degree and/or diameter). One such construction was given by McKay, Miller, and ˇSir´aˇn in [5], which produces large graphs of diameter 2 with the aid of the voltage assignment technique. Here we show how to re-engineer the McKay-Miller-ˇSir´aˇn construction in order to obtain large mixed graphs of diameter 2, i.e. graphs containing both directed arcs and undirected edges.
dc.publisherElsevier B.V.
dc.relation.isformatofVersió postprint del document publicat a:
dc.relation.ispartofElectronic Notes in Discrete Mathematics, 2016, vol. 54, p. 151-156
dc.rightscc-by-nc-nd (c) Elsevier B.V., 2016
dc.subjectNetwork design
dc.subjectDegree/Diameter Problem
dc.subjectMixed graphs
dc.subjectVoltage assignment
dc.subject.classificationDisseny assistit per ordinador
dc.subject.otherComputer-aided design
dc.titleA variant of the McKay-Miller-Siran construction for Mixed Graphs

Files in this item


This item appears in the following Collection(s)

Show simple item record

cc-by-nc-nd (c) Elsevier B.V., 2016
Except where otherwise noted, this item's license is described as cc-by-nc-nd (c) Elsevier B.V., 2016