الرئيسية › دليل الباحثين › Mustapha Chellali
Mustapha Chellali
الانتماء : University of Blida
- 173منشورات (انتماء جزائري)
- 232مجموع المنشورات
- 2451الاستشهادات
- 27مؤشر h
الملف البحثي
لدى Mustapha Chellali 173 منشور(ات) مفهرسة (2019–2026). تُنشر أعماله أساسًا في «AKCE International Journal of Graphs and Combinatorics»، «Discrete Applied Mathematics» و«RAIRO - Operations Research». أكثر مقالاته استشهادًا هو «Roman Domination in Graphs» (2020)، وقد استُشهد به 79 مرة. 32 من هذه المنشورات تعود إلى آخر ثلاث سنوات من النشاط. شارك في تأليف أعماله 12 باحثًا على الأقل، منهم باحثون من مؤسسات في الولايات المتحدة، إيران، كندا، جنوب أفريقيا.
هل هذا أنت؟ عرّف بأبحاثك
أنشئ ملفك على DzCademia مجانًا وأضف مقالاتك: ستظهر بسهولة أكبر على Google وفي مساعدي الذكاء الاصطناعي مثل ChatGPT، فيقرؤها ويستشهد بها عدد أكبر من الناس.
إنشاء ملفي المجاني إضافة منشوراتيمجالات البحث
- Advanced Graph Theory Research
- Graph Labeling and Dimension Problems
- Complexity and Algorithms in Graphs
- Graph theory and applications
- Limits and Structures in Graph Theory
المنشورات (173)
- Dual-server domination in graphs
- Lower bounds for signed double Roman k -domination in unicyclic graphs
- The Roman domatic problem in graphs and digraphs II: A survey
- A note on two characterizations on domination in the subdivision of trees
- On signed total double Roman domination number of graphs
- On 3-component domination in trees
- Dual-Server Total Domination in Graphs
- Varieties of Roman domination III
- Triad domination critical graphs upon edge removal
- 3-Path domination in trees
- Outer independent double Roman domination in unicyclic and bicyclic graphs
- Perfect triple Roman domination
- Outer independent $$\{2\}$$-domination in graphs
- On weak double Roman domination in graphs
- A note on the independent bondage number of planar graphs
- Minority sets in graphs
- A note on extremal trees for a bound on the double domination number
- Total restrained coalitions in graphs
- Dual-Server Domination in Graphs
- Outer-independent triple Roman domination
- Bounds on the quasi-total double Roman domination number in graphs
- Varieties of Roman domination IV
- Outer independent $\{2\}$-domination in trees
- Disprove of a conjecture on the double Roman domination number
- Quasi total double Roman domination in graphs
- Weak Double Roman Domination
- Further results on outer independent triple Roman domination
- Restrained K-Domination
- Vertex-edge domination dot critical graphs
- More results on the outer-independent triple Roman domination number
- Gallai Theorems Involving Minority and Majority Parameters
- On independent [1, k]-set in graphs
- On [ k ] -Roman domination in graphs
- On the Outer Independent Total Double Roman Domination in Graphs
- Restrained {2}-domination in graphs
- Hop total Roman domination in graphs
- Independent Roman bondage of graphs
- Restrained Italian reinforcement number in graphs
- Graphs with small or large Roman {3}-domination number
- Global dominated coloring of graphs
- Graphs with unique minimum vertex-edge dominating sets
- Further results on independent edge-vertex domination
- Well ev-covered trees
- Independent k -rainbow bondage number of graphs
- Algorithmic Aspects of Total Vertex-Edge Domination in Graphs
- Double Roman Domination in Graphs with Minimum Degree at Least Two and No $$C_{5}$$-cycle
- Global triple Roman dominating function
- Cubic graphs have paired-domination number at most four-seventh of their orders
- Restrained condition on double Roman dominating functions
- Quasi-total Roman reinforcement in graphs
- An improved upper bound on the independent double Roman domination number of trees
- On [k]-Roman domination subdivision number of graphs
- Further results on independent double roman trees
- Restrained Italian bondage number in graphs
- On the 2-independence subdivision number of graphs
- RESTRAINED ROMAN REINFORCEMENT NUMBER IN GRAPHS
- A proof of a conjecture on the paired-domination subdivision number
- Restrained k-rainbow reinforcement number in graphs
- On [j, k]-Sets in Graphs
- A Proof of a Conjecture on the Connected Domination Number
- A counterexample to a conjecture of Jafari Rad and Volkmann
- Restrained reinforcement number in graphs
- Maximal double Roman domination in graphs
- Further Progress on the Total Roman $$\{2\}$$-Domination Number of Graphs
- A Note on the Paired-Domination Subdivision Number of Trees
- On the Outer-Independent Double Roman Domination of Graphs
- Outer independent signed double Roman domination
- On the Paired-Domination Subdivision Number of a Graph
- Complexity of the paired domination subdivision problem
- Total vertex-edge domination in trees
- Outer independent Roman domination number of trees
- Game $k$-Domination Number of Graphs
- Some new results on the b-domatic number of graphs
- Roman domination in graphs with minimum degree at least two and some forbidden cycles
- Graphs whose weak Roman domination number increases by the deletion of any edge
- Total vertex-edge domination in trees
- Roman Domination in Graphs
- Varieties of Roman domination II
- Triple Roman domination in graphs
- Total Roman \{2\} -dominating functions in graphs
- A note on the double domination number in trees
- A characterization of perfect Roman trees
- On the Roman domination subdivision number of a graph
- On a Relation between the Perfect Roman Domination and Perfect Domination Numbers of a Tree
- Some progress on the mixed roman domination in graphs
- Vertices belonging to all or to no minimum double dominating sets in trees
- Connected Domination
- Nordhaus–Gaddum type results for connected and total domination
- A proof of a conjecture on the differential of a subcubic graph
- On the dominator chromatic number of the generalized caterpillars forest
- Edge domination and 2-independence in trees
- Edge lifting and Roman domination in graphs
- A sharp upper bound on the independent 2-rainbow domination in graphs with minimum degree at least two
- Outer independent double Roman domination
- An improved upper bound on the double Roman domination number of graphs with minimum degree at least two
- 2-domination dot-stable and dot-critical graphs
- Edges contained in all or in no minimum edge dominating set of a tree
- On Two Open Problems on Double Vertex-Edge Domination in Graphs
- (a, b)-Roman Domination on Cacti
- $k$-Efficient partitions of graphs
مجلات النشر
- AKCE International Journal of Graphs and Combinatorics × 14
- Discrete Applied Mathematics × 10
- RAIRO - Operations Research × 8
- Discrete Mathematics Algorithms and Applications × 7
- Asian-European Journal of Mathematics × 6
- Discussiones Mathematicae Graph Theory × 4
المنشورات حسب السنة
- 202610
- 202513
- 20249
- 202313
- 202217
- 202114
- 202017
- 20197
التعاون العلمي
المؤسسات الشريكة : University Yahia Fares of Medea · University of Boumerdes · University of Sciences and Technology Houari Boumediene · University of Calgary · East Tennessee State University
بلدان المؤلفين المشاركين : الولايات المتحدة · إيران · كندا · جنوب أفريقيا
المؤلفون المشاركون
- Mostafa Blidia
- Nacéra Meddah
- Ahmed Bouchou
- Razika Boutrig
- Houcine Boumediene Merouane
- Soufiane Khelifi
- Noureddine Ikhlef-Eschouf
- Mohamed Bouzefrane
- Abdelkader Rahmouni
- Mohamed Zemir
- Rahma Lounes
- Kamel Tablennehas
البيانات البيبليوغرافية مصدرها OpenAlex (قاعدة مفتوحة).
لماذا تختارون Dzcademia؟
ملفات أكاديمية ومقالات ومداخلات علمية: امنحوا أبحاثكم حضوراً عاماً منظماً. تساعد البيانات الوصفية المدمجة محركات البحث ومساعدات الذكاء الاصطناعي على التعرف على أعمالكم وفهم مراجعها.
علّق عبر Google
سجّل الدخول عبر Google للتعليق مباشرة على هذه الصفحة.