Ignacio M. Pelayo

1.7k total citations
47 papers, 917 citations indexed

About

Ignacio M. Pelayo is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Electrical and Electronic Engineering. According to data from OpenAlex, Ignacio M. Pelayo has authored 47 papers receiving a total of 917 indexed citations (citations by other indexed papers that have themselves been cited), including 44 papers in Computational Theory and Mathematics, 16 papers in Computer Networks and Communications and 11 papers in Electrical and Electronic Engineering. Recurrent topics in Ignacio M. Pelayo's work include Advanced Graph Theory Research (31 papers), Graph Labeling and Dimension Problems (28 papers) and Interconnection Networks and Systems (13 papers). Ignacio M. Pelayo is often cited by papers focused on Advanced Graph Theory Research (31 papers), Graph Labeling and Dimension Problems (28 papers) and Interconnection Networks and Systems (13 papers). Ignacio M. Pelayo collaborates with scholars based in Spain, Argentina and United States. Ignacio M. Pelayo's 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 and has published in prestigious journals such as Applied Mathematics and Computation, Computers & Mathematics with Applications and Theoretical Computer Science.

In The Last Decade

Ignacio M. Pelayo

44 papers receiving 848 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Ignacio M. Pelayo Spain 13 830 249 226 114 96 47 917
Mercè Ferrater Mora Spain 13 802 1.0× 227 0.9× 219 1.0× 64 0.6× 60 0.6× 49 870
María Luz Puertas Spain 12 567 0.7× 188 0.8× 147 0.7× 44 0.4× 50 0.5× 48 628
Herbert Fleischner Austria 14 498 0.6× 183 0.7× 153 0.7× 133 1.2× 183 1.9× 64 616
Jenő Lehel Hungary 15 746 0.9× 276 1.1× 180 0.8× 163 1.4× 361 3.8× 83 853
Hein van der Holst United States 13 430 0.5× 303 1.2× 106 0.5× 59 0.5× 100 1.0× 36 507
Alexander Kelmans United States 11 396 0.5× 306 1.2× 84 0.4× 110 1.0× 128 1.3× 43 526
Charles Payan France 10 402 0.5× 108 0.4× 88 0.4× 118 1.0× 116 1.2× 27 481
Geoffrey Exoo United States 12 424 0.5× 238 1.0× 191 0.8× 171 1.5× 267 2.8× 61 609
J Bermond France 12 348 0.4× 171 0.7× 328 1.5× 363 3.2× 131 1.4× 22 690
Iztok Peterin Slovenia 11 359 0.4× 134 0.5× 66 0.3× 63 0.6× 123 1.3× 71 408

Countries citing papers authored by Ignacio M. Pelayo

Since Specialization
Citations

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

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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 of co-authors of Ignacio M. Pelayo

This figure shows the co-authorship network connecting the top 25 collaborators of Ignacio M. Pelayo. A scholar is included among the top collaborators of Ignacio M. Pelayo based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Ignacio M. Pelayo. Ignacio M. Pelayo is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Hernando, Carmen, et al.. (2019). Neighbor-locating colorings in graphs. Theoretical Computer Science. 806. 144–155. 2 indexed citations
2.
Cáceres, José, Carmen Hernando, Mercè Ferrater Mora, Ignacio M. Pelayo, & María Luz Puertas. (2018). General bounds on limited broadcast domination. Discrete Mathematics & Theoretical Computer Science. vol. 20 no. 2(Graph Theory). 3 indexed citations
3.
Hernando, Carmen, Mercè Ferrater Mora, & Ignacio M. Pelayo. (2018). Resolving dominating partitions in graphs. Discrete Applied Mathematics. 266. 237–251. 5 indexed citations
4.
Hernando, Carmen, Mercè Ferrater Mora, & Ignacio M. Pelayo. (2017). Locating domination in bipartite graphs and their complements. RECERCAT (Consorci de Serveis Universitaris de Catalunya). 4 indexed citations
5.
Pelayo, Ignacio M., et al.. (2017). Dominating 2- broadcast in graphs: complexity, bounds and extremal graphs. LA Referencia (Red Federada de Repositorios Institucionales de Publicaciones Científicas). 4 indexed citations
6.
Hernando, Carmen, Mercè Ferrater Mora, & Ignacio M. Pelayo. (2017). Metric-locating-dominating partitions in graphs. arXiv (Cornell University). 1 indexed citations
7.
Hernando, Carmen, Mercè Ferrater Mora, & Ignacio M. Pelayo. (2013). Nordhaus–Gaddum bounds for locating domination. European Journal of Combinatorics. 36. 1–6. 21 indexed citations
8.
Cáceres, José, Carmen Hernando, Mercè Ferrater Mora, Ignacio M. Pelayo, & María Luz Puertas. (2013). Locating–dominating codes: Bounds and extremal cardinalities. Applied Mathematics and Computation. 220. 38–45. 15 indexed citations
9.
Cáceres, José, Carmen Hernando, Mercè Ferrater Mora, Ignacio M. Pelayo, & María Luz Puertas. (2012). On the metric dimension of infinite graphs. Discrete Applied Mathematics. 160(18). 2618–2626. 19 indexed citations
10.
Changat, Manoj, et al.. (2010). The Longest path transit function of a graph and betweenness. LA Referencia (Red Federada de Repositorios Institucionales de Publicaciones Científicas). 82. 111–127. 2 indexed citations
11.
Cáceres, José, Carmen Hernando, Mercè Ferrater Mora, Ignacio M. Pelayo, & María Luz Puertas. (2010). On the geodetic and the hull numbers in strong product graphs. Computers & Mathematics with Applications. 60(11). 3020–3031. 22 indexed citations
12.
Cáceres, José, Carmen Hernando, Mercè Ferrater Mora, et al.. (2007). Geodeticity of the contour of chordal graphs. Discrete Applied Mathematics. 156(7). 1132–1142. 9 indexed citations
13.
Marcote, X., C. Balbuena, & Ignacio M. Pelayo. (2006). On the connectivity of cages with girth five, six and eight. Discrete Mathematics. 307(11-12). 1441–1446. 12 indexed citations
14.
Marcote, X., C. Balbuena, Ignacio M. Pelayo, & J. Fàbrega. (2005). (δ,g)-cages with g10 are 4-connected. Discrete Mathematics. 301(1). 124–136. 10 indexed citations
15.
Pelayo, Ignacio M.. (2004). Comment on “The Steiner number of a graph” by G. Chartrand and P. Zhang. Discrete Mathematics. 280(1-3). 259–263. 10 indexed citations
16.
Gómez, J., Ignacio M. Pelayo, & C. Balbuena. (2003). Diameter vulnerability of GC graphs. Discrete Applied Mathematics. 130(3). 395–416. 1 indexed citations
17.
Marcote, X., Ignacio M. Pelayo, & C. Balbuena. (2003). Every cubic cage is quasi 4-connected. Discrete Mathematics. 266(1-3). 311–320. 8 indexed citations
18.
Balbuena, C., Ignacio M. Pelayo, & J. Gómez. (2002). On the superconnectivity of generalized p-cycles. Discrete Mathematics. 255(1-3). 13–23. 5 indexed citations
19.
Pelayo, Ignacio M., C. Balbuena, & J. Gómez. (2001). On the connectivity of generalized p-cycles.. Ars Combinatoria. 58. 3 indexed citations
20.
Pelayo, Ignacio M., et al.. (1999). New large graphs with given degree and diameter six. Networks. 34(2). 154–161. 3 indexed citations

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.

Explore authors with similar magnitude of impact

Rankless by CCL
2026