Home › Researcher directory › Mostafa Blidia
Mostafa Blidia
Affiliation : University of Blida
- 41Publications (affiliation in Algeria)
- 64Total publications
- 456Citations
- 11h-index
Research profile
Mostafa Blidia has 41 indexed publications (1993–2022). Their work appears mainly in “Discrete Mathematics”, “Opuscula Mathematica” and “HAL”. Their most cited article, “Locating-domination and identifying codes in trees” (2007), has been cited 57 times. 5 of these publications date from the last three years of activity. Their work is co-authored with at least 10 researchers, including institutions in France.
Is this you? Get your research seen
Create your free DzCademia profile and add your articles: they will show up more easily on Google and in AI assistants like ChatGPT, so more people can read and cite your work.
Create my free profile Add my publicationsResearch areas
- Advanced Graph Theory Research
- Complexity and Algorithms in Graphs
- Graph Labeling and Dimension Problems
- Limits and Structures in Graph Theory
- Graph theory and applications
Publications (41)
- On the 2-independence subdivision number of graphs
- A counterexample to a conjecture of Jafari Rad and Volkmann
- Roman domination in oriented trees
- Vertices belonging to all or to no minimum double dominating sets in trees
- A note on Duchet's conjecture
- On the k-domination number of digraphs
- Extremal Digraphs for an Upper Bound on the Double Roman Domination Number
- Extremal digraphs for an upper bound on the Roman domination number
- Some results on the b-chromatic number in complementary prism graphs
- Extremal graphs for a bound on the Roman domination number
- A characterization of be-critical trees
- A characterization of edge b-critical graphs
- A new generalization of kernels in digraphs
- Criticality indices of 2-rainbow domination of paths and cycles
- On edge-b-critical graphs
- Relations between the Roman k-domination and Roman domination numbers in graphs
- On b-vertex and b-edge critical graphs
- A note on k-Roman graphs
- A characterization of trees for a new lower bound on the k-independence number
- On vertex b-critical trees
- b-coloring of some bipartite graphs
- Characterization of bγ-perfect graphs
- A characterization of locating-total domination edge critical graphs
- Characterizations of trees with unique minimum locating-dominating sets
- Double domination edge removal critical graphs
- On b -colorings in regular graphs
- On b-colorings in regular graphs
- Vertices belonging to all or to no minimum locating dominating sets of trees
- Maximal k-independent sets in graphs
- Locating-domination and identifying codes in trees
- On k -independence in graphs with emphasis on trees
- Extremal perfect graphs for a bound on the domination number
- A note on a Vizing's generalized conjecture
- Characterizations of trees with equal paired and double domination numbers
- Some bounds on the p-domination number in trees
- Ratios of Some Domination Parameters in Graphs and Claw-free Graphs
- Extremal graphs for a new upper bound on domination parameters in graphs
- On average lower independence and domination numbers in graphs
- On the p-domination number of cactus graphs
- Some operations preserving the existence of kernels
- On kernels in perfect graphs
Publication venues
- Discrete Mathematics × 7
- Opuscula Mathematica × 6
- HAL × 6
- Discussiones Mathematicae Graph Theory × 5
- Discrete Applied Mathematics × 4
- Communications in combinatorics and optimization × 2
Publications per year
- 20222
- 20211
- 20202
- 20193
- 20183
- 20171
- 20162
- 20143
- 20132
- 20123
Collaborations
Partner institutions : University Yahia Fares of Medea · Université Joseph Fourier · Laboratoire des Sciences pour la Conception, l'Optimisation et la Production · University of Blida 2 · Institut polytechnique de Grenoble
Co-authors’ countries : France
Co-authors
- Mustapha Chellali
- Noureddine Ikhlef-Eschouf
- Ahmed Bouchou
- Nacéra Meddah
- Lyes Ouldrabah
- Amel Bendali-Braham
- Rahma Lounes
- Zoham Zemir
- Soufiane Khelifi
- Amina Ramoul
Bibliographic data from OpenAlex (open database).
Why choose Dzcademia?
Profiles, articles and conference contributions: give your research a structured public presence. Integrated metadata help search engines and AI assistants identify your work and understand its references.
Comment with Google
Sign in with Google to comment directly on this page.