Raymond E. Pippert
Impact in
-
- Limits and Structures in Graph Theory
- Geometry and Topology top 5%
- Graph theory and applications
Papers in
-
- Advanced Graph Theory Research 12
- Graph Labeling and Dimension Problems 4
- Complexity and Algorithms in Graphs 3
-
- Graph theory and applications 6
- Mathematics and Applications 4
- Co-authors
- Lowell W. Beineke (14 shared papers)Ortrud R. Oellermann (2 shared papers)Marc J. Lipman (7 shared papers)Gary Chartrand (1 shared paper)Wayne Goddard (2 shared papers)Peter Hamburger (10 shared papers)Pál Erdös (1 shared paper)Linda Lesniak (1 shared paper)
- Journals
- Discrete Mathematics (4 papers)Journal of Graph Theory (2 papers)Discrete Applied Mathematics (2 papers)Geometriae Dedicata (2 papers)Networks (2 papers)
- Partner nations
- United StatesCanadaHungary
In The Last Decade
Raymond E. Pippert
25 papers receiving 354 citations
Peers
Comparison fields: 5 of 67
- Discrete Mathematics and Combinatorics 58
- Geometry and Topology 141
- Computational Theory and Mathematics 232
- Computer Networks and Communications 156
- Computer Graphics and Computer-Aided Design 20
Countries citing papers authored by Raymond E. Pippert
This map shows the geographic impact of Raymond E. Pippert'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 Raymond E. Pippert with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Raymond E. Pippert more than expected).
Fields of papers citing papers by Raymond E. Pippert
This network shows the impact of papers produced by Raymond E. Pippert. 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 Raymond E. Pippert. The network helps show where Raymond E. Pippert may publish in the future.
Co-authors
The 9 scholars most cited alongside Raymond E. Pippert, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
Showing the 20 most-cited of 28 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 2002 | 82 | |
| 2 | 1969 | 66 | |
| 3 | 1992 | 59 | |
| 4 | 1971 | 49 | |
| 5 | 1974 | 30 | |
| 6 | 1994 | 20 | |
| 7 | 1996 | 15 | |
| 8 | 1971 | 11 | |
| 9 | 1993 | 10 | |
| 10 | 1993 | 7 | |
| 11 | 1996 | 7 | |
| 12 | 1996 | 6 | |
| 13 | 1997 | 5 | |
| 14 | 1974 | 4 | |
| 15 | Toward a measure of vulnerability II. The ratio of disruption | 1985 | 3 |
| 16 | 1996 | 3 | |
| 17 | 1969 | 3 | |
| 18 | 1992 | 2 | |
| 19 | The Integrity of the Cube is Small | 2006 | 2 |
| 20 | 1974 | 2 |
About Raymond E. Pippert
Raymond E. Pippert is a scholar working on Computational Theory and Mathematics, Geometry and Topology, Computer Networks and Communications, Electrical and Electronic Engineering and Computer Graphics and Computer-Aided Design, having authored 28 papers that have together received 392 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (12 papers), Interconnection Networks and Systems (7 papers), Graph theory and applications (6 papers), Graph Labeling and Dimension Problems (4 papers), Mathematics and Applications (4 papers), Computational Geometry and Mesh Generation (4 papers), graph theory and CDMA systems (3 papers) and Complexity and Algorithms in Graphs (3 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (58 citations), Geometry and Topology (141 citations), Computational Theory and Mathematics (232 citations), Computer Networks and Communications (156 citations) and Computer Graphics and Computer-Aided Design (20 citations). Raymond E. Pippert has collaborated with scholars based in United States, Canada and Hungary. Frequent co-authors include Lowell W. Beineke, Ortrud R. Oellermann, Marc J. Lipman, Gary Chartrand, Wayne Goddard, Peter Hamburger, Pál Erdös, Linda Lesniak and Daniel J. Kleitman. Their work appears in journals such as Discrete Mathematics, Journal of Graph Theory, Discrete Applied Mathematics, Geometriae Dedicata and Networks.
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.