Loading...
Loading...

Go to the content (press return)

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

Author
Dalfo, C.; Fiol, M.
Type of activity
Journal article
Journal
Electronic journal of graph theory and applications
Date of publication
2014
Volume
2
Number
1
First page
1
Last page
17
Repository
http://hdl.handle.net/2117/22938 Open in new window
URL
http://www.ejgta.org/index.php/ejgta/article/view/38/13 Open in new window
Abstract
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...
Citation
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.
Keywords
(Delta,D) problema, (Delta,N) problema, Digraphs, Double-step, Unilateral distance
Group of research
COMBGRAPH - Combinatorics, Graph Theory and Applications

Participants