Loading...
Loading...

Go to the content (press return)

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

Author
Dalfo, C.; Fiol, M.
Type of activity
Presentation of work at congresses
Name of edition
The 7th GraphMasters Workshop
Date of publication
2013
Presentation's date
2013-06-26
Book of congress proceedings
7a edició del GraphMasters workshop a Lleida. 25 de juny i fins al 28 de juny de 2013
First page
11
Last page
11
URL
http://www.cig.udl.cat/sitemedia/files/gm7.pdf 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, obtained by changing the directions of all the arcs. The rst 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 rst) consists of minimizing the unilateral diameter given the maximum d...
Keywords
(Delta, D) Problem, Double-step digraph, N) problem, Unilateral distance
Group of research
COMBGRAPH - Combinatorics, Graph Theory and Applications

Participants