Dense bus networks of diameter 2. - Jean-Claude Bermond; Johny Bond; Selma Djelloul (Interconnection Networks and Mapping and Scheduling Parallel Computations, 1994)

Broadcasting in m-dimensional grid graphs with a given neighborhood template. - Selma Djelloul (Discret. Appl. Math., 1994)

Edge Deletion Preserving the Diameter of the Hypercube. - Abdelmadjid Bouabdallah; Charles Delorme; Selma Djelloul (Discret. Appl. Math., 1995)

On weighted mean distance. - Selma Djelloul; Mekkia Kouider (Australas. J Comb., 2001)

Minimum survivable graphs with bounded distance increase. - Selma Djelloul; Mekkia Kouider (Discret. Math. Theor. Comput. Sci., 2003)

Graph decompositions for cartesian products. - Selma Djelloul (Electron. Notes Discret. Math., 2005)

Treewidth and logical definability of graph products. - Selma Djelloul (Theor. Comput. Sci., 2009)

Solving Matching Problems Efficiently in Bipartite Graphs. - Selma Djelloul (IWOCA, 2014)

Edge k-q-Colorability of Graphs. - Selma Djelloul; Odile Favaron; Mekkia Kouider (J. Graph Algorithms Appl., 2018)