CURRICULUM VITAE

 


Informations générales :

Nom et Prénom: Mustapha Chellali

Situation familiale: Marié et père de deux enfants.

Adresse professionnelle: Université Saâd Dahlab de Blida, Faculté des Sciences,

                                      Département de Mathématiques.  B.P. 270, Blida.  Algérie.

                                      Tél/Fax : 025 43 36 42

                                      Email : mchellali@hotmail.com;  m_chellali@yahoo.com 

Fonction:   Enseignant-Chercheur

Grade pédagogique: Professeur

Titres et diplômes :

Publications Internationales :

 

  1. M.Chellali, L. Volkmann, Relations between the lower domination parameters and the chromatic number of a graph. Discrete Mathematics, 274 (2004) 1—8.
  2. M. Chellali, T.W. Haynes, Trees with unique minimum paired dominating sets. Ars Combinatoria, 73 (2004) 3—12.
  3. M. Chellali, T.W. Haynes, Total and paired-domination numbers in trees. AKCE International Journal of Graphs and Combinatorics, Vol 1, N° 2 (2004) 69—75.
  4. M. Blidia, M. Chellali, F. Maffray, On average lower independence and domination numbers in graphs. Discrete Mathematics, 295 (2005) 1—11.
  5. M. Blidia, M. Chellali, S. Khelifi, Vertices belonging to all or to no minimum double dominating sets in trees.  AKCE International Journal of Graphs and Combinatorics, Vol 2, N° 1 (2005) 1—9.
  6. M. Chellali, On weak and restrained domination in trees. AKCE International Journal of Graphs and Combinatorics, Vol 2, N° 1 (2005) 39—44.
  7. M.Chellali, T.W. Haynes, On paired and double domination in graphs. Utilitas Mathematica, 67 (2005) 161—171
  8. M. Chellali, A. Khelladi, F. Maffray, Exact double domination in graphs.             Discussionnes Mathematicae Graph Theory, 25 (2005) 291—302
  9. M.Blidia, M. Chellali, L. Volkmann, On the p-domination number of cactus graphs.        Discussionnes Mathematicae Graph Theory, 25 (2005) 355361.
  10. M.Blidia, M.Chellali, O. Favaron, Independence and 2-domination in trees.             Australasian Journal of Combinatorics, 33 (2005) 317—327
  11. M.Blidia, M. Chellali, T.W. Haynes, Characterizations of trees with equal paired and double domination numbers. Discrete Mathematics, Vol. 306/16 (2006) 18401845.
  12. M.Blidia, M. Chellali, L. Volkmann, Some bounds on the p-domination number in trees.              Discrete Mathematics, Vol. 306/17 (2006) 2031—2037
  13. M.Blidia, M. Chellali, F. Maffray, Extremal graphs on a new upper bound for the domination parameters in graphs. Discrete Mathematics, 306/19-20 (2006) 2314—2326
  14. M. Blidia, M. Chellali, T.W. Haynes, M.A. Henning, Independent and double domination in trees. Utilitas Mathematica, 70 (2006) 159—173
  15. M. Chellali, T.W. Haynes, A note on the total domination number of a tree. Jour. of Combinatorial Math.  and Combinatorial Computing, 58(2006)189—193.
  16. M. Chellali, Bounds on the 2-domination number of cactus graphs. Opuscula Mathematica, Vol. 26/1 (2006) 5—12.
  17. M. Chellali, A note on the double domination number in trees. AKCE Int. Journal of Graphs and Combinatorics, Vol. 3, No.2(2006) 117—120
  18. M. Blidia, M.Chellali, O. Favaron, Ratios of some domination parameters in graphs and claw free graphs. Graph Theory Trends in Mathematics, 6172 (2006) Birkhäuser Verlag Basel/Switzerland.
  19. M. Blidia, M. Chellali, L. Volkmann, Bounds of the 2-domination number of graphs.              Utilitas Mathematica, 71 (2006) 209—216
  20. M. Chellali, T.W. Haynes, Global alliances and independence in trees. Discussionnes Mathematicae Graph Theory,27 (2007)1927.
  21. M.Blidia, M.Chellali, O. Favaron, N. Meddah, On k-independence in graphs with emphasis on trees.Discrete Mathematics, 307 (2007) 2209-2216.
  22. M. Blidia, M. Chellali, F. Maffray, J. Moncel, A. Semri, Locating domination and identifying codes in trees. Australasian Journal of Combinatorics, 39 (2007) 219—232.
  23. M. Blidia, M. Chellali, A note on a generalized Vizing’s conjecture. Opuscula Mathématica, 27 (2007) 181— 185.
  24. M. Blidia, M. Chellali, F. Maffray, Extremal perfect graphs for a bound on the domination number. Discrete Mathematics,308 (2008) 1785—1791
  25. M. Blidia, M. Chellali, O. Favaron, N. Meddah, Maximal k-independent sets in graphs.Discussiones Mathematicae Graph Theory,28 (1) (2008) 151—163
  26. M. Chellali, O. Favaron, T.W. Haynes, D. Raber, Ratios of some domination parameters in trees. Discrete Mathematics, 308 (2008) 3879—3887
  27. M. Chellali, On locating and differentiating-total domination in trees. Discussiones Mathematicae Graph Theory, 28 (3) (2008)383392.
  28. M. Chellali, O. Favaron, On k-star-forming sets in graphs. Jour.  of Comb. Math. and Comb. Computing, 68 (2009) 205—214.
  29. M. Chellali, T.W Haynes, L. Volkmann, Global offensive alliance numbers in graphs with emphasis on trees. Australasian Journal of Combinatorics, 45(2009) 87-96.—
  30. M. Chellali, N. Jafari Rad, Locating-total domination critical graphs. Australasian Journal of Combinatorics, 45 (2009) 227—234.
  31. M. Bouzefrane, M. Chellali, On the global offensive alliance number of a tree.  Opuscula Mathematica, 29 (2009) 223—228.
  32. M. Chellali, T.W. Haynes, B. Randerath, L. Volkmann, Bounds on the global offensive k-alliance number in graphs. Discussiones Mathematicae Graph Theory, 29 (2009) 597613.
  33. M. Chellali, M. Mimouni, P.J. Slater, On locating-domination in graphs. Discussiones Mathematicae Graph Theory, 30 (2010) 223—235.
  34. M. Chellali, T.W. Haynes, L. Volkmann, k-Independence stable graphs upon edge removal. Discussiones Mathematicae Graph Theory, 30 (2010) 265—274
  35. M. Chellali, L. Volkmann, Independence and global offensive alliance in graphs. Australasian Journal of Combinatorics, 47 (2010) 125—131.
  36. M. Chellali, T.W. Haynes, Double domination stable graphs upon edge removal.Australasian Journal of Combinatorics, 47 (2010) 157—164.
  37. M. Chellali, Trees with equal global offensive k-alliance and k-domination numbers.Opuscula Mathematica, 30 (2010) 249—254.
  38. M. ChellaliOffensive alliances in bipartite graphs. Journal of Combin. Math. and Combinatorial Computing, 73 (2010) 245255.
  39. M. Chellali, F. Maffray, K. Tablennehas, Connected domination dot-critical graphs. Contributions to Discrete Mathematics, Vol 5, N°2 (2010) 11—25.
  40. M. Bouzefrane, M.Chellali, T.W. Haynes, Global defensive alliances in trees. Utilitas Mathematica, 82 (2010) 241252.
  41. M. Blidia, M. Chellali, S. Khelifi, F. Maffray, Double Domination Edge RemovalCritical Graphs. Australasian Journal of Combinatorics, 48 (2010) 285—299.
  42. B. Chaluvaraju, M. Chellali, K.A. Vidya, Perfect k-domination in graphs.Australasian Journal of Combinatorics, 48 (2010) 175—184.
  43. M. Chellali, T.W. Haynes, A characterization of trees with unique minimum double dominating sets. Utilitas Mathematica, 83 (2010) 233—242.
  44. M. Chellali, O. Favaron, A. Hansberg, L. Volkmann, On the p-domination, the total domination and the connected domination numbers of graphs. Journal of Combinatorial Math. and Combin. Computing, 73 (2010) 65—75.   
  45. M. Bouzefrane, M. Chellali, A note on global alliances in trees. Opuscula Mathematica, 31 (2011) 153—158.
  46. M. Blidia, M. Chellali,  F. Maffray, R. Lounes, Characterizations of trees with unique minimum locating-dominating sets. , 76 (2011)  225—232. 
  47. A. Anitha, S. Arumugam, M. ChellaliEquitable domination in graphs.Discrete Mathematics, Algorithms and Applications, Vol.3, Issue 3 (2011) 311-321.
  48. M. Chellali, L. Volkmann, Characterization of trees with equal 2-domination number and domination number plus two.Discussiones Math. Graph Theory, 31 (2011) 687—697.
  49. M. Chellali, L. Volkmann, Global offensive k-alliance in bipartite graphs. Opuscula Mathematica, 32/1 (2012) 83—89.
  50. M. Chellali, O. Favaron, A. Hansberg, L. Volkmann, k-domination and k-independence in graphs : A survey. Graphs and Combinatorics, 28 (2012) 1--55.
  51. M. Chellali, F. Maffray, Dominator coloring in some classes of graphs. Graphs and Combinatorics, 28 (2012) 97--107.
  52. M.Chellali, N. Jafari Rad, A. Khodkar, On 3-gamma_{t}-vertex critical graphs of diameter three.Discrete Applied Mathematics, 160 (2012) 676—681.
  53. R. Boutrig, M. ChellaliA note on a relationship between the weak and strong domination numbers in graphs. Opuscula Mathematica, 32/2 (2012) 235--238.
  54. M. Chellali, N. Meddah, Trees with equal 2-domination and 2-independence numbers.Discussiones Mathematicae Graph Theory, 32 (2012) 263--270.
  55. M. Chellali, N. Jafari Rad, k-Independence Critical Graphs.  Australasian Jour. Of Combin., 53 (2012) 289--298.
  56. S. Khelifi, M. Chellali, Double domination critical and stable graphs upon vertex removal. Discussiones Mathematicae Graph Theory 23 (2012) 643—657.
  57. H. Boumediene Merouane, M. Chellali,  On the dominator colorings in trees. Discussiones Mathematicae Graph Theory 32 (2012) 677—683.
  58. M. Chellali, N. Jafari Rad, L. Volkmann, Some results on Roman domination edge critical graphs. AKCE Journal 9 (2012) 195--203.
  59. M. Chellali, N. Jafari Rad, On (fully) total domination dot-stable graphs. The Bulletin of the ICA, 66 (2012) 109-120.
  60. M. Chellali, N. Jafari Rad, Strong equality between the Roman domination and independent Roman domination numbers in trees.Discussiones Mathematicae Graph Theory 33 (2013) 337—346.
  61. K. Attalah, M.Chellali, On connected k-domination in graphs. Australasian Jour. Of Combin., 55 (2013) 289--298.
  62. M. Chellali, N. Jafari Rad, On 2-Rainbow domination and Roman domination in graphs. Australasian Journal of Combinatorics 56 (2013) 85-93.
  63. S. Arumugam, M. Chellali,  T.W. Haynes, Equivalence domination in graphs. Quaestiones Mathematicae, 36 (3) (2013) 331—340.
  64. M. Bouchou, M. Blidia, M. Chellali, A note on k-Roman graphs. Opuscula Mathematica 33 (2013) 641—646.
  65. M. Chellali, T.W. Haynes, S.T. Hedetniemi, A. McRae, [1,2]-sets in graphs. Discrete Applied Mathematics 161 (18) (2013) 2885—2893.
  66. M. Blidia, M. Chellali, S. Khelifi, F. Maffray, Erratum to: double domination edge eemovalcritical graphs. Australasian Journal of Combinatorics 55 (2013) pp 315.
  67. M. Chellali, O. Favaron, T.W. Haynes, S.T. Hedetniemi, A. McRae, independent [1,k]-sets in graphs. Australasian J. of Combinatorics, 59 (1) (2014) 144–156
  68. M. Chellali, N.Jafri Rad, Weak total domination in graphs. Utilitas Mathematica, 94 (2014) 221—236.  (Numéro spécial dédié à Teresa W. Haynes  pour ses 60 ans)
  69. M. Chellali, N. Jafari Rad, Trees with unique Roman dominating functions of minimum weight. Discrete Mathematics, Algorithms and Applications Vol. 6, No. 3 (2014) 1450038
  70. M. Bouchou, M. Blidia, M. Chellali, Relations between the Roman k-domination and Roman domination numbers in graphs. Discrete Mathematics, Algorithms and Applications, Vol.6, No. 3 (2014) 1450045
  71. M. Chellali, T.W. Haynes, S.T. Hedetniemi, Bounds on weak roman and 2-rainbow domination numbers. Discrete Applied Mathematics 178 (2014) 27—32.
  72. M. Chellali, N. Jafri Rad, S. Seo, P.J. Slater, On open neighborhood locating-dominating in Graphs.  Electronic Journal of Graph Theory and Applications 2(2) (2014) 87-98.
  73. M. Chellali, k-domination stable graphs upon edge removal. Ars Combinatoria 119 (2015) 13-21.
  74. H. Boumediene Merouane, M. Haddad, M. Chellali, H. Kheddouci, Dominated coloring in graphs. Graphs and Combinatorics 31 (2015) 713—727.
  75. H. Boumediene Merouane, M. Chellali,  An algorithm for the dominator chromatic number of a tree. Journal of Combinatorial Optimisation 30 (2015) 27--33.
  76. H.Boumediene Merouane, M. Chellali,  On secure domination in graphs. Information Processing Letters 115 (10) (2015) 786–-790.
  77. M. Chellali, N. Jafari Rad, Roman domination stable graphs upon edge-addition.Utilitas Mathematica 96 (2015) 165-178.
  78. J. Amjadi, M. Chellali,  M. Falahat, S. M. Sheikholeslami, On the independent 2-rainbow domination numbers in unicyclic graphs. Transactions on Combinatorics,
  79. M. Chellali, N. Jafari Rad, Independent 2-rainbow domination in graphs. Jour. of Combina. Math.  and Combinatorial Computing, 94 (2015) 133—148.
  80. M. Chellali, T.W. Haynes, S.T. Hedetniemi, Total and Roman dominition, Quaestiones Mathematicae, 86 (6) (2015) 749-757.
  81. M. Chellali, N. Jafari Rad, Trees with independent Roman domination number twice the independent domination number. Discrete Mathematics, Algorithms and Applications, Vol 07, No. 4 (2015) 1550048.  
  82. M. Chellali, T.W. Hayènes, S.M. Hedetniemi, S.T. Hedetniemi, A. MacRae, A Roman domination chain.  Graphs and Combinatorics, 32 (2016) 79-92 .
  83. M. Chellali, T.W. Haynes, S.T. Hedetniemi, A. MacRae, Roman {2}-domination. Discrete Applied Mathematics, 204 (2016) 22-28.
  84. D. A. Mojdeh, M.R. Sayed Salehi, M. ChellaliNeighborhood total domination of a graph and its complement. Australasian Journal of Combinatorics 65 (2016) 37--44.
  85. R. Boutrig, M. Chellali, T. W. Haynes,  S.T. Hedetniemi, Vertex-edge domination in graphs. Aquaestiones Mathematicae 90 (2016) 355-366.
  86. M. Chellali, T.W. Haynes, S.T. Hedetniemi, Lower bounds on the Roman and independentRoman domination numbers.  App. Ana. Disc. Math., 10 (2016) 65—72.
  87. H. Abdollahzadeh Ahangar, M. Chellali, D. Kuziak, V.  Samodivkin, On maximal Roman domination in graphs.  International Journal of Computer Mathematics, 93 (7) (2016) 1093—1102. 
  88. A. Alimadadi, M. Chellali, D. A. Mojdeh, Liar's dominating sets in graphsDiscrete Apllied Mathematics, 211 (2016) 204—210.
  89. A. Alishahi, M. Chellali, D. A. Mjdeh, Characterization of trees T with equal global domination number ofT and the square of Australasian J. of Combin. 66 (2016) 288--309.
  90. M. Chellali, T.W. Haynes, S.T. Hedetniemi, T. Lewis, On ve-degrees and ev-degrees in graphs. Discrete Mathematics  340 (2017)  31–-38.
  91. M. Chellali, T.W. Haynes, S.T. Hedetniemi, T. Lewis, Pebbling and domination in graphs. Discrete Applied Mathematics, 221 (2017) 46-53.
  92. N. Meddah, M. Chellali, Roman Domination and 2-Independance in Trees. Discrete Mathematics, Algorithms and Applications, 9 (2) (2017) 1750023.
  93. B. Krishnakumari, M. Chellali,  Y. B. Venkatakrishnan, Double Vertex-Edge Domination.Discrete Mathematics, Algorithms and Applications, Vol. 9, No. 4(2017) 1750045 (11pages)
  94. H. Abdollahzadeh ahangar, M. Chellali,  S.M. Sheikholeslami, On the double Roman domination in graphs. Discrete Applied Mathematics, 232 (2017) 1—7.

    95. H. Abdollahzadeh Ahangar, M. Chellali, V.  Samodivkin, Outer independent Roman domination in graphs. International Journal of Computing Mathematics, 94 (12) (2017) 2547—2557.

   96. A. Rahmouni, M. Chellali, Independent Roman {2}-domination in graphs. Discrete Applied Mathematics, 236 (2018) 408–414.

    97. M. Blidia, M. Chellali, Locating domination dot-critical graphs. Jour. of Comb. Math and Comb. Computing, 104(2018) 121-141. (Numéro spécial à la mémoire de Peter J. Slater)

    98. H. Abdollahzadeh Ahangar, M. Chellali, D. Kuziak, V. Samodivkin, Connected graphs with maximal Roman domination number one less than their order. Ars conmbinatoria, à paraitre. 

   99. H. Abdollahzadeh Ahangar, J. Amjadi, M. Atapour, M. Chellali, S.M. Sheikholeslami, Double Roman trees. Ars Combinatoria, à paraitre

  100. R. Boutrig, M. Chellali, Total vertex-edge domination. International Journal of Computing Mathematics, à paraître

  101. M. Chellali, T.W. Haynes, S.T. Hedetniemi, Client- Server and cost effective sets in graphs. AKCE International Journal Of Graphs and Combinatorics, à paraître

  102. H. Abdollahzadeh Ahangar, J. Amjadi, M.Chellali, S. Nazari-Moghaddam, S.M. Sheikholeslami, Totale Roman reinforcement in graphs. Discussiones Mathematicae Graph Theory, à paraitre 

  103. H. Abdollahzadeh Ahangar, J. Amjadi, M. Chellali, S. Nazari-Moghaddam, S.M. Sheikholeslami, Trees with double Roman domination number twice the domination number plus two. Iranian Journal of Science and Technology Transactions A : Science, à paraitre.

  104. R. Sahbi, M. Chellali, On some open questions concerning quorum colorings of graphs. Discrete Applied Mathematics, à paraître.

  105. Y. Zhao, H. Abdollahzadeh Ahangar, H. Shang, M. Chellali, (a; b)-Roman Domination on CactiAdvances in Intelligent and Soft Computing, à paraître.

  106. A. Bouchou, , M. BlidiaM. Chellali, Extremal graphs for a bound on the Roman domination number. Discussiones Mathematicae Graph Theory, à paraître.

Arbitrage pour des revues scientifiques :

Je suis souvent sollicité pour expertiser des articles pour des revues internationales, citons par exemple :

Discrete Mathematics

Discrete Applied Mathematics

Graphs and Combinatorics

Journal of Combinatorial Optimization

Discussiones Mathematicae Graph Theorey

Australasian Journal of Combinatorics

Ars Combinatoria

Journal of Combinatorial Mathematics and Combinatorial Computing

Utilitas Mathematica

Discrete Mathematics, Algorithms and Applications

Par ailleurs, j’ai arbitré quatre articles pour des numéros spéciaux, à savoir :

Activités d’encadrement :

1-      Doctorat

2-      Magister

3-      Master

Activités scientifiques :