2026-04-18T06:03:25Zhttps://recercat.cat/oai/request

oai:recercat.cat:2117/223162025-07-17T08:45:12Zcom_2072_1033col_2072_452950

The (Delta,D) and (Delta,N) problems in double-step digraphs with unilateral diameter Dalfó Simó, Cristina Fiol Mora, Miquel Àngel Universitat Politècnica de Catalunya. Departament de Matemàtica Aplicada IV Universitat Politècnica de Catalunya. COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions Àrees temàtiques de la UPC::Matemàtiques i estadística::Matemàtica discreta::Teoria de grafs Graph theory Grafs, Teoria de 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 of vertices. We solve the first problem for every value of the unilateral diameter and the second one for some infinitely many values of the number of vertices. Miller and Sirán [4] wrote a comprehensive survey about (D;D) and (D;N) problems. In particular, for the double-step graphs considering the standard diameter, the first problem was solved by Fiol, Yebra, Alegre and Valero [3], whereas Bermond, Iliades and Peyrat [2], and also Beivide, Herrada, Balcázar and Arruabarrena [1] solved the (D;N) problem. In the case of the double-step digraphs, also with the standard diameter, Morillo, Fiol and Fàbrega [5] solved the (D;D) problem and provided some infinite families of digraphs which solve the (D;N) problem for their corresponding numbers of vertices Postprint (author’s final draft) 2013 Conference lecture 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. 978-88-7642-474-8 https://hdl.handle.net/2117/22316 eng http://cataleg.upc.edu/record=b1431828~S1*cat http://creativecommons.org/licenses/by-nc-nd/3.0/es/ Open Access Attribution-NonCommercial-NoDerivs 3.0 Spain 6 p. application/pdf