Wilfried Imrich
About
In The Last Decade
Wilfried Imrich
103 papers receiving 2.1k citations
Hit Papers
Peers
Comparison fields: 5 of 90
- Computational Theory and Mathematics 1.7k
- Geometry and Topology 937
- Discrete Mathematics and Combinatorics 601
- Computer Networks and Communications 464
- Electrical and Electronic Engineering 460
Countries citing papers authored by Wilfried Imrich
This map shows the geographic impact of Wilfried Imrich'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 Wilfried Imrich with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Wilfried Imrich more than expected).
Fields of papers citing papers by Wilfried Imrich
This network shows the impact of papers produced by Wilfried Imrich. 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 Wilfried Imrich. The network helps show where Wilfried Imrich may publish in the future.
Co-authorship network of co-authors of Wilfried Imrich
This figure shows the co-authorship network connecting the top 25 collaborators of Wilfried Imrich. A scholar is included among the top collaborators of Wilfried Imrich 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 Wilfried Imrich. Wilfried Imrich is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 4 | |
| 2 | Algebraic graph theory - a volume dedicated to Gert Sabidussi on the occasion of his 80th birthday | 1 |
| 3 | 7 | |
| 4 | 2 | |
| 5 | 9 | |
| 6 | Characterization of Trivalent Graphs with Minimal Eigenvalue Gap | 6 |
| 7 | 12 | |
| 8 | Finite and infinite hypercubes as direct products. | 3 |
| 9 | 2 | |
| 10 | Product graphs: structure and recognition breakdown → | 572 |
| 11 | 3 | |
| 12 | A characterization of halved cubes. | 0 |
| 13 | 37 | |
| 14 | 26 | |
| 15 | Classification of tensor products of symmetric graphs | 1 |
| 16 | 18 | |
| 17 | 12 | |
| 18 | 38 | |
| 19 | Transitive planar graphs | 14 |
| 20 | 2 |
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.