Mustapha Chellali

Orcid: 0000-0001-5231-6195

According to our database1, Mustapha Chellali authored at least 111 papers between 2004 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Restrained {2}-domination in graphs.
RAIRO Oper. Res., September, 2023

Graphs with unique minimum vertex-edge dominating sets.
RAIRO Oper. Res., July, 2023

Restrained Italian bondage number in graphs.
Discret. Math. Algorithms Appl., July, 2023

Graphs with small or large Roman {3}-domination number.
RAIRO Oper. Res., May, 2023

Well <i>ev</i>-covered trees.
RAIRO Oper. Res., May, 2023

Independent Roman bondage of graphs.
RAIRO Oper. Res., March, 2023

Quasi-total Roman reinforcement in graphs.
AKCE Int. J. Graphs Comb., January, 2023

Hop total Roman domination in graphs.
AKCE Int. J. Graphs Comb., January, 2023

Restrained condition on double Roman dominating functions.
Appl. Math. Comput., 2023

2022
Further results on independent double roman trees.
AKCE Int. J. Graphs Comb., September, 2022

An improved upper bound on the independent double Roman domination number of trees.
AKCE Int. J. Graphs Comb., September, 2022

On [<i>k</i>]-Roman domination subdivision number of graphs.
AKCE Int. J. Graphs Comb., September, 2022

Outer independent signed double Roman domination.
J. Appl. Math. Comput., April, 2022

A proof of a conjecture on the paired-domination subdivision number.
Graphs Comb., 2022

Double Roman Domination in Graphs with Minimum Degree at Least Two and No C<sub>5</sub>-cycle.
Graphs Comb., 2022

A new upper bound for the perfect Italian domination number of a tree.
Discuss. Math. Graph Theory, 2022

The Roman domatic problem in graphs and digraphs: a survey.
Discuss. Math. Graph Theory, 2022

Total Roman 2-dominating functions in graphs.
Discuss. Math. Graph Theory, 2022

Graphs whose weak Roman domination number increases by the deletion of any edge.
Discret. Math. Algorithms Appl., 2022

Cubic graphs have paired-domination number at most four-seventh of their orders.
Discret. Math., 2022

Global triple Roman dominating function.
Discret. Appl. Math., 2022

Maximal double Roman domination in graphs.
Appl. Math. Comput., 2022

Note on the domination number of graphs with forbidden cycles of lengths not divisible by 3.
Australas. J Comb., 2022

2021
Nordhaus-Gaddum type results for connected and total domination.
RAIRO Oper. Res., 2021

On the dominator chromatic number of the generalized caterpillars forest.
RAIRO Oper. Res., 2021

Some progress on the mixed roman domination in graphs.
RAIRO Oper. Res., 2021

Some new results on the b-domatic number of graphs.
Electron. J. Graph Theory Appl., 2021

Total 2-rainbow domination numbers in trees.
Discuss. Math. Graph Theory, 2021

Edge lifting and Roman domination in graphs.
Discret. Math. Algorithms Appl., 2021

Triple Roman domination in graphs.
Appl. Math. Comput., 2021

2020
On the Roman domination subdivision number of a graph.
J. Comb. Optim., 2020

On the Outer-Independent Double Roman Domination of Graphs.
Frontiers Appl. Math. Stat., 2020

Extremal graphs for a bound on the Roman domination number.
Discuss. Math. Graph Theory, 2020

A characterization of perfect Roman trees.
Discret. Appl. Math., 2020

A proof of a conjecture on the differential of a subcubic graph.
Discret. Appl. Math., 2020

A sharp upper bound on the independent 2-rainbow domination in graphs with minimum degree at least two.
Comput. Sci. J. Moldova, 2020

Outer independent double Roman domination.
Appl. Math. Comput., 2020

Varieties of Roman domination II.
AKCE Int. J. Graphs Comb., 2020

On the double Roman domination number in trees.
Australas. J Comb., 2020

2019
Total Roman reinforcement in graphs.
Discuss. Math. Graph Theory, 2019

Edges contained in all or in no minimum edge dominating set of a tree.
Discret. Math. Algorithms Appl., 2019

An improved upper bound on the double Roman domination number of graphs with minimum degree at least two.
Discret. Appl. Math., 2019

Signed double Roman domination in graphs.
Discret. Appl. Math., 2019

On two open problems concerning weak Roman domination in trees.
Australas. J Comb., 2019

2018
Total vertex-edge domination.
Int. J. Comput. Math., 2018

On some open problems concerning quorum colorings of graphs.
Discret. Appl. Math., 2018

Independent Roman -domination in graphs.
Discret. Appl. Math., 2018

Client-server and cost effective sets in graphs.
AKCE Int. J. Graphs Comb., 2018

2017
Outer independent Roman dominating functions in graphs.
Int. J. Comput. Math., 2017

Roman domination and 2-independence in trees.
Discret. Math. Algorithms Appl., 2017

Double vertex-edge domination.
Discret. Math. Algorithms Appl., 2017

On ve-degrees and ev-degrees in graphs.
Discret. Math., 2017

Restricted optimal pebbling and domination in graphs.
Discret. Appl. Math., 2017

On the double Roman domination in graphs.
Discret. Appl. Math., 2017

2016
On maximal Roman domination in graphs.
Int. J. Comput. Math., 2016

A Roman Domination Chain.
Graphs Comb., 2016

Roman {2}-domination.
Discret. Appl. Math., 2016

Liar's dominating sets in graphs.
Discret. Appl. Math., 2016

Neighborhood total domination of a graph and its complement.
Australas. J Comb., 2016

Trees with the same global domination number as their square.
Australas. J Comb., 2016

2015
An algorithm for the dominator chromatic number of a tree.
J. Comb. Optim., 2015

On Secure Domination in Graphs.
Inf. Process. Lett., 2015

Dominated Colorings of Graphs.
Graphs Comb., 2015

Trees with independent Roman domination number twice the independent domination number.
Discret. Math. Algorithms Appl., 2015

k-Domination stable graphs upon edge removal.
Ars Comb., 2015

2014
On open neighborhood locating-dominating in graphs.
Electron. J. Graph Theory Appl., 2014

Trees with unique Roman dominating functions of minimum weight.
Discret. Math. Algorithms Appl., 2014

Relations between the Roman k-domination and Roman domination numbers in graphs.
Discret. Math. Algorithms Appl., 2014

Bounds on weak roman and 2-rainbow domination numbers.
Discret. Appl. Math., 2014

Independent [1, k]-sets in graphs.
Australas. J Comb., 2014

2013
Strong equality between the Roman domination and independent Roman domination numbers in trees.
Discuss. Math. Graph Theory, 2013

[1, 2]-sets in graphs.
Discret. Appl. Math., 2013

ERRATUM to: Double domination edge removal critical graphs.
Australas. J Comb., 2013

On 2-rainbow domination and Roman domination in graphs.
Australas. J Comb., 2013

On connected k-domination in graphs.
Australas. J Comb., 2013

2012
Dominator Colorings in Some Classes of Graphs.
Graphs Comb., 2012

k-Domination and k-Independence in Graphs: A Survey.
Graphs Comb., 2012

On the dominator colorings in trees.
Discuss. Math. Graph Theory, 2012

Trees with equal 2-domination and 2-independence numbers.
Discuss. Math. Graph Theory, 2012

Double domination critical and stable graphs upon vertex removal.
Discuss. Math. Graph Theory, 2012

On 3-y<sub>t</sub>-vertex critical graphs of diameter three.
Discret. Appl. Math., 2012

k-independence critical graphs.
Australas. J Comb., 2012

Dominated Coloring of Graphs.
Proceedings of the 11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2012

2011
Characterization of trees with equal 2-domination number and domination number plus two.
Discuss. Math. Graph Theory, 2011

Equitable domination in Graphs.
Discret. Math. Algorithms Appl., 2011

2010
On locating-domination in graphs.
Discuss. Math. Graph Theory, 2010

<i>k</i>-independence stable graphs upon edge removal.
Discuss. Math. Graph Theory, 2010

Connected domination dot-critical graphs.
Contributions Discret. Math., 2010

Double domination edge removal critical graphs.
Australas. J Comb., 2010

Independence and global offensive alliance in graphs.
Australas. J Comb., 2010

Double domination stable graphs upon edge removal.
Australas. J Comb., 2010

Perfect k-domination in graphs.
Australas. J Comb., 2010

2009
Bounds on the global offensive <i>k</i>-alliance number in graphs.
Discuss. Math. Graph Theory, 2009

Locating-total domination critical graphs.
Australas. J Comb., 2009

Global offensive alliance numbers in graphs with emphasis on trees.
Australas. J Comb., 2009

2008
On locating and differetiating-total domination in trees.
Discuss. Math. Graph Theory, 2008

Maximal k-independent sets in graphs.
Discuss. Math. Graph Theory, 2008

Ratios of some domination parameters in trees.
Discret. Math., 2008

Extremal perfect graphs for a bound on the domination number.
Discret. Math., 2008

2007
Global Alliances and Independence in Trees.
Discuss. Math. Graph Theory, 2007

On k-independence in graphs with emphasis on trees.
Discret. Math., 2007

Locating-domination and identifying codes in trees.
Australas. J Comb., 2007

2006
Some bounds on the p-domination number in trees.
Discret. Math., 2006

Extremal graphs for a new upper bound on domination parameters in graphs.
Discret. Math., 2006

Characterizations of trees with equal paired and double domination numbers.
Discret. Math., 2006

2005
Exact double domination in graphs.
Discuss. Math. Graph Theory, 2005

On the p-domination number of cactus graphs.
Discuss. Math. Graph Theory, 2005

On average lower independence and domination numbers in graphs.
Discret. Math., 2005

Independence and 2-domination in trees.
Australas. J Comb., 2005

2004
Relations between the lower domination parameters and the chromatic number of a graph.
Discret. Math., 2004

Trees with Unique Minimum Paired-Dominating Sets.
Ars Comb., 2004


  Loading...