Carregant...
Carregant...

Vés al contingut (premeu Retorn)

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

Autor
Dalfo, C.; Fiol, M.
Tipus d'activitat
Presentació treball a congrés
Nom de l'edició
Seventh European Conference on Combinatorics, Graph Theory and Applications
Any de l'edició
2013
Data de presentació
2013-09-09
Llibre d'actes
EUROCOMB 2013. European Conference on Combinatorics, Graph Theory and Applications. Pisa, Italy, September 9-13, 2013
Pàgina inicial
91
Pàgina final
96
Repositori
http://hdl.handle.net/2117/22316 Obrir en finestra nova
URL
http://cataleg.upc.edu/record=b1431828~S1*cat Obrir en finestra nova
Resum
We study the (D;D) and (D;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, 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 D and the unilateral diameter D , whereas the second one consists of minimizing the unilateral diameter given the maximum degree and the number...
Citació
Dalfo, C.; Fiol, M. The (Delta,D) and (Delta,N) problems in double-step digraphs with unilateral diameter. A: European Conference on Combinatorics, Graph Theory and Applications. "EUROCOMB 2013. European Conference on Combinatorics, Graph Theory and Applications. Pisa, Italy, September 9-13, 2013". Pisa: 2013, p. 91-96.
Grup de recerca
COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions

Participants