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
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.
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
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
Marcote, X., C. Balbuena, Ignacio M. Pelayo, & J. Fàbrega. (2005). (δ,g)-cages with g⩾10 are 4-connected. Discrete Mathematics. 301(1). 124–136.10 indexed citations
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
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.