Mostafa Blidia
Impact in
-
- Limits and Structures in Graph Theory
-
- Advanced Graph Theory Research
- Graph Labeling and Dimension Problems
- Complexity and Algorithms in Graphs
Papers in
-
- Advanced Graph Theory Research 32
- Graph Labeling and Dimension Problems 14
- Complexity and Algorithms in Graphs 12
- Advanced Algebra and Logic 2
-
- Limits and Structures in Graph Theory 10
- Co-authors
- Mustapha Chellali (12 shared papers)Odile Favaron (4 shared papers)Frédéric Maffray (7 shared papers)Lutz Volkmann (4 shared papers)Teresa W. Haynes (1 shared paper)Pierre Duchet (2 shared papers)Konrad Engel (1 shared paper)S. Arumugam (1 shared paper)
In The Last Decade
Mostafa Blidia
31 papers receiving 194 citations
Peers
Comparison fields: 5 of 19
- Discrete Mathematics and Combinatorics 48
- Computational Theory and Mathematics 202
- Geometry and Topology 33
- Computer Networks and Communications 51
- Computer Graphics and Computer-Aided Design 4
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 8 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 35 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | Independence and 2-domination in trees. | 2005 | 29 |
| 2 | 2009 | 23 | |
| 3 | 2006 | 20 | |
| 4 | Locating-domination, 2-domination and independence in trees. | 2008 | 19 |
| 5 | 2006 | 19 | |
| 6 | 2008 | 13 | |
| 7 | 2007 | 11 | |
| 8 | 2011 | 9 | |
| 9 | 1993 | 8 | |
| 10 | 1986 | 8 | |
| 11 | 2005 | 7 | |
| 12 | 2012 | 6 | |
| 13 | 1999 | 6 | |
| 14 | 2006 | 3 | |
| 15 | 2018 | 3 | |
| 16 | A characterization of locating-domination edge critical graphs. | 2009 | 2 |
| 17 | Bounds on the k-independence and k-chromatic numbers of graphs | 2014 | 2 |
| 18 | On b-colorings in regular graphs | 2009 | 2 |
| 19 | 2016 | 2 | |
| 20 | 2018 | 2 |
About Mostafa Blidia
Mostafa Blidia is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics, Computer Networks and Communications, Geometry and Topology and Mathematical Physics, having authored 35 papers that have together received 211 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (32 papers), Graph Labeling and Dimension Problems (14 papers), Complexity and Algorithms in Graphs (12 papers), Limits and Structures in Graph Theory (10 papers), Interconnection Networks and Systems (6 papers), Graph theory and applications (5 papers), Optimization and Search Problems (3 papers) and Advanced Algebra and Logic (2 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (48 citations), Computational Theory and Mathematics (202 citations), Geometry and Topology (33 citations), Computer Networks and Communications (51 citations) and Computer Graphics and Computer-Aided Design (4 citations). Mostafa Blidia has collaborated with scholars based in Algeria, France and Germany. Frequent co-authors include Mustapha Chellali, Odile Favaron, Frédéric Maffray, Lutz Volkmann, Teresa W. Haynes, Pierre Duchet, 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.