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

All of RECERCAT

To access the full text documents, please follow this link: http://hdl.handle.net/2117/22938

Title:	The (Delta,D) and (Delta,N) problems in double-step digraphs with unilateral distance
Author:	Dalfó Simó, Cristina; Fiol Mora, Miquel Àngel
Other authors:	Universitat Politècnica de Catalunya. Departament de Matemàtica Aplicada IV; Universitat Politècnica de Catalunya. COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions
Abstract:	We study the (delta;D) and (delta;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 given the maximum degree and the number of vertices. We solve the first problem for every value of the unilateral diameter and the second one for infinitely many values of the number of vertices. Moreover, we compute the mean unilateral distance of the digraphs in the families considered.
Subject(s):	-Àrees temàtiques de la UPC::Matemàtiques i estadística::Matemàtica discreta::Teoria de grafs -Graph theory -Unilateral distance -Double-step -Digraphs -Grafs, Teoria de
Rights:	Attribution-NonCommercial-NoDerivs 3.0 Spain http://creativecommons.org/licenses/by-nc-nd/3.0/es/
Document type:	Article - Published version Article
Share: