Ignacio M. Pelayo
- Computational Theory and Mathematics top 0.5%
- Advanced Graph Theory Research 31
- Graph Labeling and Dimension Problems 28
- Complexity and Algorithms in Graphs 4
- Geometry and Topology top 2%
- Graph theory and applications 7
-
- Computational Geometry and Mesh Generation 6
-
- Interconnection Networks and Systems 13
-
- graph theory and CDMA systems 10
-
- Coding theory and cryptography 3
Ignacio M. Pelayo
44 papers receiving 848 citations
Peers
Comparison fields: 5 of 61
- Computational Theory and Mathematics 830
- Discrete Mathematics and Combinatorics 96
- Geometry and Topology 249
- Computer Graphics and Computer-Aided Design 41
- Computer Networks and Communications 114
Countries citing papers authored by Ignacio M. Pelayo
This map shows the geographic impact of Ignacio M. Pelayo'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 Ignacio M. Pelayo with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Ignacio M. Pelayo more than expected).
Fields of papers citing papers by Ignacio M. Pelayo
This network shows the impact of papers produced by Ignacio M. Pelayo. 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 Ignacio M. Pelayo. The network helps show where Ignacio M. Pelayo may publish in the future.
Co-authorship network
The 14 scholars most cited alongside Ignacio M. Pelayo, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
| # | Work | ||
|---|---|---|---|
| 1 | 2019 | 2 | |
| 2 | 2018 | 3 | |
| 3 | 2018 | 5 | |
| 4 | Locating domination in bipartite graphs and their complements | 2017 | 4 |
| 5 | Dominating 2- broadcast in graphs: complexity, bounds and extremal graphs | 2017 | 4 |
| 6 | Metric-locating-dominating partitions in graphs | 2017 | 1 |
| 7 | 2013 | 21 | |
| 8 | 2013 | 15 | |
| 9 | 2012 | 19 | |
| 10 | The Longest path transit function of a graph and betweenness | 2010 | 2 |
| 11 | 2010 | 22 | |
| 12 | 2007 | 9 | |
| 13 | 2006 | 12 | |
| 14 | 2005 | 10 | |
| 15 | 2004 | 10 | |
| 16 | 2003 | 1 | |
| 17 | 2003 | 8 | |
| 18 | 2002 | 5 | |
| 19 | On the connectivity of generalized p-cycles. | 2001 | 3 |
| 20 | 1999 | 3 |
About Ignacio M. Pelayo
Ignacio M. Pelayo is a scholar working on Computational Theory and Mathematics, Computer Graphics and Computer-Aided Design and Discrete Mathematics and Combinatorics, having authored 47 papers that have together received 917 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (31 papers), Graph Labeling and Dimension Problems (28 papers), Interconnection Networks and Systems (13 papers), graph theory and CDMA systems (10 papers), Graph theory and applications (7 papers), Computational Geometry and Mesh Generation (6 papers), Complexity and Algorithms in Graphs (4 papers) and Coding theory and cryptography (3 papers). The work is most often cited by research in Computational Theory and Mathematics (830 citations), Discrete Mathematics and Combinatorics (96 citations) and Geometry and Topology (249 citations). Ignacio M. Pelayo has collaborated with scholars based in Spain, Argentina and United States. Frequent co-authors include Carmen Hernando, Mercè Ferrater Mora, Carlos Seara, José Cáceres, David R. Wood, María Luz Puertas, C. Balbuena, X. Marcote, Tao Jiang and J. Fàbrega.
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.