Mostafa Blidia
Impact in
-
- Advanced Graph Theory Research
- Graph Labeling and Dimension Problems
- Complexity and Algorithms in Graphs
-
- Limits and Structures in Graph Theory
- Advanced Combinatorial Mathematics
Papers in
-
- Advanced Graph Theory Research 43
- Graph Labeling and Dimension Problems 6
- Co-authors
- Mustapha Chellali (18 shared papers)Frédéric Maffray (12 shared papers)Odile Favaron (5 shared papers)Teresa W. Haynes (2 shared papers)Julien Moncel (1 shared paper)Lutz Volkmann (4 shared papers)Pierre Duchet (2 shared papers)Michael A. Henning (1 shared paper)
In The Last Decade
Mostafa Blidia
39 papers receiving 299 citations
Peers
Comparison fields: 5 of 8
- Computational Theory and Mathematics 306
- Discrete Mathematics and Combinatorics 9
- Geometry and Topology 5
- Algebra and Number Theory 1
- Statistical and Nonlinear Physics 2
Countries citing papers authored by Mostafa Blidia
This map shows the geographic impact of Mostafa Blidia's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Mostafa Blidia with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Mostafa Blidia more than expected).
Fields of papers citing papers by Mostafa Blidia
This network shows the impact of papers produced by Mostafa Blidia. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Mostafa Blidia. The network helps show where Mostafa Blidia may publish in the future.
Co-authors
The 10 scholars most cited alongside Mostafa Blidia, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
Showing the 20 most-cited of 43 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | Locating-domination and identifying codes in trees | 2007 | 43 |
| 2 | Independence and 2-domination in trees. | 2005 | 31 |
| 3 | 2009 | 26 | |
| 4 | 2006 | 25 | |
| 5 | Locating-domination, 2-domination and independence in trees. | 2008 | 21 |
| 6 | 2006 | 19 | |
| 7 | 2011 | 17 | |
| 8 | 2008 | 16 | |
| 9 | 2007 | 12 | |
| 10 | Characterizations of trees with unique minimum locating-dominating sets | 2011 | 10 |
| 11 | Independent and Double Domination in Trees | 2006 | 9 |
| 12 | 1986 | 8 | |
| 13 | 1993 | 8 | |
| 14 | 1999 | 6 | |
| 15 | 2006 | 6 | |
| 16 | 2012 | 6 | |
| 17 | 2005 | 5 | |
| 18 | 2006 | 4 | |
| 19 | b-coloring of some bipartite graphs | 2012 | 4 |
| 20 | 2014 | 4 |
About Mostafa Blidia
Mostafa Blidia is a scholar working on Computational Theory and Mathematics, Nuclear Energy and Engineering, Waste Management and Disposal, Infectious Diseases and Organic Chemistry, having authored 43 papers that have together received 318 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (43 papers) and Graph Labeling and Dimension Problems (6 papers). The work is most often cited by research in Computational Theory and Mathematics (306 citations), Discrete Mathematics and Combinatorics (9 citations), Geometry and Topology (5 citations), Algebra and Number Theory (1 citation) and Statistical and Nonlinear Physics (2 citations). Mostafa Blidia has collaborated with scholars based in Algeria, France and Germany. Frequent co-authors include Mustapha Chellali, Frédéric Maffray, Odile Favaron, Teresa W. Haynes, Julien Moncel, Lutz Volkmann, Pierre Duchet, Michael A. Henning, Konrad Engel and S. Arumugam. Their work appears in journals such as Discrete Mathematics, Discrete Applied Mathematics, Journal of Combinatorial Optimization, COMBINATORICA and Graphs and Combinatorics.
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.