Loading...
Loading...

Go to the content (press return)

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

Author
Dalfo, C.; Fiol, M.
Type of activity
Presentation of work at congresses
Name of edition
Seventh European Conference on Combinatorics, Graph Theory and Applications
Date of publication
2013
Presentation's date
2013-09-09
Book of congress proceedings
EUROCOMB 2013. European Conference on Combinatorics, Graph Theory and Applications. Pisa, Italy, September 9-13, 2013
First page
91
Last page
96
Repository
http://hdl.handle.net/2117/22316 Open in new window
URL
http://cataleg.upc.edu/record=b1431828~S1*cat Open in new window
Abstract
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...
Citation
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.
Group of research
COMBGRAPH - Combinatorics, Graph Theory and Applications

Participants

Attachments