J.-C. Bermond
Impact in
-
- Limits and Structures in Graph Theory
- Finite Group Theory Research
-
- Advanced Graph Theory Research
- Graph Labeling and Dimension Problems
Papers in
-
- Advanced Graph Theory Research 7
- Graph Labeling and Dimension Problems 3
-
- graph theory and CDMA systems 7
- Co-authors
- Carsten Thomassen (1 shared paper)Charles Delorme (3 shared papers)J.-J. Quisquater (1 shared paper)Odile Favaron (1 shared paper)Maryvonne Mahéo (1 shared paper)Jean-Jacques Quisquater (2 shared papers)Claudine Peyrat (2 shared papers)Péter Frankl (1 shared paper)
- Journals
- Journal of Graph Theory (2 papers)Journal of Combinatorial Theory Series B (1 paper)SIAM Journal on Discrete Mathematics (1 paper)Bulletin of the London Mathematical Society (1 paper)Journal of Parallel and Distributed Computing (1 paper)
- Partner nations
- FranceBelgiumUnited States
In The Last Decade
J.-C. Bermond
13 papers receiving 381 citations
Peers
Comparison fields: 5 of 40
- Discrete Mathematics and Combinatorics 176
- Computational Theory and Mathematics 264
- Geometry and Topology 93
- Computer Networks and Communications 171
- Electrical and Electronic Engineering 246
Countries citing papers authored by J.-C. Bermond
This map shows the geographic impact of J.-C. Bermond'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 J.-C. Bermond with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites J.-C. Bermond more than expected).
Fields of papers citing papers by J.-C. Bermond
This network shows the impact of papers produced by J.-C. Bermond. 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 J.-C. Bermond. The network helps show where J.-C. Bermond may publish in the future.
Co-authors
The 14 scholars most cited alongside J.-C. Bermond, 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 | 1981 | 127 | |
| 2 | 1986 | 110 | |
| 3 | 1989 | 96 | |
| 4 | 1982 | 29 | |
| 5 | 1990 | 13 | |
| 6 | 1992 | 11 | |
| 7 | 1977 | 11 | |
| 8 | 1980 | 8 | |
| 9 | 1989 | 7 | |
| 10 | Interconnection network with each node on two buses | 1986 | 6 |
| 11 | 1981 | 6 | |
| 12 | 1989 | 4 | |
| 13 | 1989 | 2 |
About J.-C. Bermond
J.-C. Bermond is a scholar working on Computational Theory and Mathematics, Electrical and Electronic Engineering, Discrete Mathematics and Combinatorics, Geometry and Topology and Computer Networks and Communications, having authored 13 papers that have together received 430 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (7 papers), graph theory and CDMA systems (7 papers), Graph theory and applications (5 papers), Interconnection Networks and Systems (4 papers), Limits and Structures in Graph Theory (3 papers), Graph Labeling and Dimension Problems (3 papers), Finite Group Theory Research (3 papers) and Coding theory and cryptography (2 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (176 citations), Computational Theory and Mathematics (264 citations), Geometry and Topology (93 citations), Computer Networks and Communications (171 citations) and Electrical and Electronic Engineering (246 citations). J.-C. Bermond has collaborated with scholars based in France, Belgium and United States. Frequent co-authors include Carsten Thomassen, Charles Delorme, J.-J. Quisquater, Odile Favaron, Maryvonne Mahéo, Jean-Jacques Quisquater, Claudine Peyrat, Péter Frankl, Dominique Sotteau and Katherine Heinrich. Their work appears in journals such as Journal of Graph Theory, Journal of Combinatorial Theory Series B, SIAM Journal on Discrete Mathematics, Bulletin of the London Mathematical Society and Journal of Parallel and Distributed Computing.
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.