Nacéra Meddah

According to our database, Nacéra Meddah authored at least 7 papers between 2007 and 2022.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2022

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

2019

Edges contained in all or in no minimum edge dominating set of a tree.

Nacéra Meddah, Mustapha Chellali

Discret. Math. Algorithms Appl., 2019

2017

Roman domination and 2-independence in trees.

Nacéra Meddah, Mustapha Chellali

Discret. Math. Algorithms Appl., 2017

2013

A characterization of trees for new lower bound on the <i> k</i>-independence number.

Mostafa Blidia, Nacéra Meddah

Discuss. Math. Graph Theory, 2013

2012

Trees with equal 2-domination and 2-independence numbers.

Mustapha Chellali, Nacéra Meddah

Discuss. Math. Graph Theory, 2012

2008

Maximal k-independent sets in graphs.

Mostafa Blidia, Mustapha Chellali, Odile Favaron, Nacéra Meddah

Discuss. Math. Graph Theory, 2008

2007

On k-independence in graphs with emphasis on trees.

Mostafa Blidia, Mustapha Chellali, Odile Favaron, Nacéra Meddah

Discret. Math., 2007