On k-independence in graphs with emphasis on trees. - Mostafa Blidia; Mustapha Chellali; Odile Favaron; Nacéra Meddah (Discret. Math., 2007)

Maximal k-independent sets in graphs. - Mostafa Blidia; Mustapha Chellali; Odile Favaron; Nacéra Meddah (Discuss. Math. Graph Theory, 2008)

Trees with equal 2-domination and 2-independence numbers. - Mustapha Chellali; Nacéra Meddah (Discuss. Math. Graph Theory, 2012)

A characterization of trees for new lower bound on the k-independence number. - Mostafa Blidia; Nacéra Meddah (Discuss. Math. Graph Theory, 2013)

Roman domination and 2-independence in trees. - Nacéra Meddah; Mustapha Chellali (Discret. Math. Algorithms Appl., 2017)

Edges contained in all or in no minimum edge dominating set of a tree. - Nacéra Meddah; Mustapha Chellali (Discret. Math. Algorithms Appl., 2019)

Graphs whose weak Roman domination number increases by the deletion of any edge. - Rihab Hamid; Nour El Houda Bendahib; Mustapha Chellali; Nacéra Meddah (Discret. Math. Algorithms Appl., 2022)

Gallai Theorems Involving Minority and Majority Parameters. - Mustapha Chellali; Stephen T. Hedetniemi; Nacéra Meddah (Ars Comb., 2024)

Bounds on the k-conversion number. - Mustapha Chellali; Teresa W. Haynes; Stephen T. Hedetniemi; Nacéra Meddah (Discuss. Math. Graph Theory, 2025)