Mustapha Chellali

Mustapha Chellali


Research Focus & Metrics

Academic Career Length

16Years (2011-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
8 April 2011 in Graphs and Combinatorics
Verified
Journal Article
Closed access
PDF file
MCMustapha Chellali
Mustapha Chellali
OFOdile Favaron
Odile Favaron
AHAdriana Hansberg
Adriana Hansberg
LVLutz Volkmann
Lutz Volkmann

15 January 2011 in Graphs and Combinatorics
Verified
Journal Article
Closed access
PDF file
MCMustapha Chellali
Mustapha Chellali
FMFrédéric Maffray
Frédéric Maffray

7 May 2015 in Aequationes mathematicae
Verified
Journal Article
Closed access
PDF file
RBRazika Boutrig
Razika Boutrig
MCMustapha Chellali
Mustapha Chellali
THTeresa W. Haynes
Teresa W. Haynes
SHStephen T. Hedetniemi
Stephen T. Hedetniemi

26 June 2017 in International Journal of Computer Mathematics
Verified
Journal Article
Closed access
RBRazika Boutrig
Razika Boutrig
MCMustapha Chellali
Mustapha Chellali

1 January 2019 in Filomat
Verified
Journal Article
Open access
PDF file
HAHossein Ahangar Abdollahzadeh
Hossein Ahangar Abdollahzadeh
MCMustapha Chellali
Mustapha Chellali
SSSeyed Mahmoud Sheikholeslami
Seyed Mahmoud Sheikholeslami
In this paper we continue the study of signed double Roman dominating functions in graphs. A signed double Roman dominating function (SDRDF) on a graph G = (V,E) is a function f : V(G)  {-1,1,2,3} having the property that for each v  V(G), f [v] ≥ 1, and if f (v)= -1, then vertex v has at least two neighbors assigned 2 under f or one neighbor w with f(w)=3, and if f(v)=1, then vertex v must have at leat one neighbor w with f (w)≥2. The weight of a SDRDF is the sum of its function values over all vertices. The signed double Roman domination number γsdR(G) is the minimum weight of a SDRDF on G. We present several lower bounds on the signed double Roman domination number of a graph in terms of various graph invariants. In particular, we show that if G is a graph of order n and size m with no isolated vertex, then γsdR(G) ≥ 19n-24m/9 and γsdR(G)≥4 √n/3-n. Moreover, we characterize the graphs attaining equality in these two bounds.

26 March 2015 in Graphs and Combinatorics
Verified
Journal Article
Closed access
PDF file
MCMustapha Chellali
Mustapha Chellali
THTeresa W. Haynes
Teresa W. Haynes
SHSandra M. Hedetniemi
Sandra M. Hedetniemi
SHStephen T. Hedetniemi
Stephen T. Hedetniemi
AMAlice A. McRae
Alice A. McRae