1. Home
  2. Universitat de Lleida
  3. Documents de recerca
  4. View Item

Degree/diameter problem for mixed graphs

To access the full text documents, please follow this link: http://hdl.handle.net/10459.1/57091

Author

López Lorenzo, Ignacio

Pérez Rosés, Hebert

Publication date

2016-05-24T12:00:02Z

2016-05-24T12:00:02Z

2015



Share

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.

Document Type

article
publishedVersion

Language

English

Subjects and keywords

Degree / diameter problem; Moore bound; Mixed Moore graph; Grafs, Teoria de

Publisher

Elsevier

Related items

Reproducció del document publicat a https://doi.org/10.1016/j.procs.2015.12.066

Procedia computer science, 2015, vol. 74, p. 2-9

Export

DIDL MARC MARC_CCUC METS OAI_DC ORE QDC RDF

Rights

cc-by-nc-nd (c) López et al., 2015

http://creativecommons.org/licenses/by-nc-nd/4.0/

This item appears in the following Collection(s)

Documents de recerca [17848]