Carregant...
Carregant...

Vés al contingut (premeu Retorn)

The (Delta,D) and (Delta,N) problems in double-step digraphs with unilateral distance

Autor
Dalfo, C.; Fiol, M.
Tipus d'activitat
Article en revista
Revista
Electronic Journal of Graph Theory and Applications
Data de publicació
2014
Volum
2
Número
1
Pàgina inicial
1
Pàgina final
17
Repositori
http://hdl.handle.net/2117/22938 Obrir en finestra nova
URL
http://www.ejgta.org/index.php/ejgta/article/view/38/13 Obrir en finestra nova
Resum
We study the (;D) and (;N) problems for double-step digraphs considering the unilateral distance, which is the minimum between the distance in the digraph and the distance in its converse digraph, the latter obtained by changing the directions of all the arcs. The first problem consists of maximizing the number of vertices N of a digraph, given the maximum degree and the unilateral diameter D, whereas the second one (somehow dual of the first) consists of minimizing the unilateral diameter give...
Citació
Dalfo, C.; Fiol, M. The (Delta,D) and (Delta,N) problems in double-step digraphs with unilateral distance. "Electronic Journal of Graph Theory and Applications", 2014, vol. 2, núm. 1, p. 1-17.
Paraules clau
(Delta, D) problema, Digraphs, Double-step, N) problema, Unilateral distance
Grup de recerca
COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions

Participants