Degree/diameter problem for mixed graphs

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 gra...

Full description

Bibliographic Details
Authors: López Lorenzo, Ignacio, Pérez Rosés, Hebert
Format: article
Status:Published version
Publication Date:2015
Country:España
Institution:Varias* (Consorci de Biblioteques Universitáries de Catalunya, Centre de Serveis Científics i Acadèmics de Catalunya)
Repository:Recercat. Dipósit de la Recerca de Catalunya
OAI Identifier:oai:recercat.cat:10459.1/57091
Online Access:https://doi.org/10.1016/j.procs.2015.12.066
http://hdl.handle.net/10459.1/57091
Access Level:Open access
Keyword:Degree / diameter problem
Moore bound
Mixed Moore graph
Grafs, Teoria de
id ES_8a0eecdd00be2f52afc2d5016c10b465
oai_identifier_str oai:recercat.cat:10459.1/57091
network_acronym_str ES
network_name_str España
repository_id_str
spelling Degree/diameter problem for mixed graphsLópez Lorenzo, IgnacioPérez Rosés, HebertDegree / diameter problemMoore boundMixed Moore graphGrafs, Teoria deThe 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.Elsevier2015info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionhttps://doi.org/10.1016/j.procs.2015.12.066http://hdl.handle.net/10459.1/57091reponame:Recercat. Dipósit de la Recerca de Catalunyainstname:Varias* (Consorci de Biblioteques Universitáries de Catalunya, Centre de Serveis Científics i Acadèmics de Catalunya)InglésReproducció del document publicat a https://doi.org/10.1016/j.procs.2015.12.066Procedia computer science, 2015, vol. 74, p. 2-9cc-by-nc-nd (c) López et al., 2015info:eu-repo/semantics/openAccesshttp://creativecommons.org/licenses/by-nc-nd/4.0/oai:recercat.cat:10459.1/570912026-05-29T05:05:01Z
dc.title.none.fl_str_mv Degree/diameter problem for mixed graphs
title Degree/diameter problem for mixed graphs
spellingShingle Degree/diameter problem for mixed graphs
López Lorenzo, Ignacio
Degree / diameter problem
Moore bound
Mixed Moore graph
Grafs, Teoria de
title_short Degree/diameter problem for mixed graphs
title_full Degree/diameter problem for mixed graphs
title_fullStr Degree/diameter problem for mixed graphs
title_full_unstemmed Degree/diameter problem for mixed graphs
title_sort Degree/diameter problem for mixed graphs
dc.creator.none.fl_str_mv López Lorenzo, Ignacio
Pérez Rosés, Hebert
author López Lorenzo, Ignacio
author_facet López Lorenzo, Ignacio
Pérez Rosés, Hebert
author_role author
author2 Pérez Rosés, Hebert
author2_role author
dc.subject.none.fl_str_mv Degree / diameter problem
Moore bound
Mixed Moore graph
Grafs, Teoria de
topic Degree / diameter problem
Moore bound
Mixed Moore graph
Grafs, Teoria de
description 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.
publishDate 2015
dc.date.none.fl_str_mv 2015
dc.type.none.fl_str_mv info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
format article
status_str publishedVersion
dc.identifier.none.fl_str_mv https://doi.org/10.1016/j.procs.2015.12.066
http://hdl.handle.net/10459.1/57091
url https://doi.org/10.1016/j.procs.2015.12.066
http://hdl.handle.net/10459.1/57091
dc.language.none.fl_str_mv Inglés
language_invalid_str_mv Inglés
dc.relation.none.fl_str_mv Reproducció del document publicat a https://doi.org/10.1016/j.procs.2015.12.066
Procedia computer science, 2015, vol. 74, p. 2-9
dc.rights.none.fl_str_mv cc-by-nc-nd (c) López et al., 2015
info:eu-repo/semantics/openAccess
http://creativecommons.org/licenses/by-nc-nd/4.0/
rights_invalid_str_mv cc-by-nc-nd (c) López et al., 2015
http://creativecommons.org/licenses/by-nc-nd/4.0/
eu_rights_str_mv openAccess
dc.publisher.none.fl_str_mv Elsevier
publisher.none.fl_str_mv Elsevier
dc.source.none.fl_str_mv reponame:Recercat. Dipósit de la Recerca de Catalunya
instname:Varias* (Consorci de Biblioteques Universitáries de Catalunya, Centre de Serveis Científics i Acadèmics de Catalunya)
instname_str Varias* (Consorci de Biblioteques Universitáries de Catalunya, Centre de Serveis Científics i Acadèmics de Catalunya)
reponame_str Recercat. Dipósit de la Recerca de Catalunya
collection Recercat. Dipósit de la Recerca de Catalunya
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869412672791904256
score 15,811543

Similar Items