Henda C. Swart
- Computational Theory and Mathematics top 1%
- Geometry and Topology top 1%
- Computer Networks and Communications top 10%
- Organic Chemistry
- Discrete Mathematics and Combinatorics top 5%
- Co-authors
- Peter DankelmannSimon MukwembiOrtrud R. OellermannWayne GoddardMichael A. Henningİvan GutmanDavid P. DayR. C. Entringer
- Topics
- Advanced Graph Theory Research (38 papers)Graph theory and applications (21 papers)Interconnection Networks and Systems (20 papers)
- Cited by
- Geometry and TopologyComputational Theory and MathematicsDiscrete Mathematics and Combinatorics
- Partner nations
- South AfricaUnited StatesCanada
In The Last Decade
Henda C. Swart
47 papers receiving 623 citations
Peers
Comparison fields: 5 of 53
- Computational Theory and Mathematics 516
- Geometry and Topology 440
- Computer Networks and Communications 157
- Organic Chemistry 126
- Discrete Mathematics and Combinatorics 102
Countries citing papers authored by Henda C. Swart
This map shows the geographic impact of Henda C. Swart'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 Henda C. Swart with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Henda C. Swart more than expected).
Fields of papers citing papers by Henda C. Swart
This network shows the impact of papers produced by Henda C. Swart. 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 Henda C. Swart. The network helps show where Henda C. Swart may publish in the future.
Co-authorship network of co-authors of Henda C. Swart
This figure shows the co-authorship network connecting the top 25 collaborators of Henda C. Swart. A scholar is included among the top collaborators of Henda C. Swart 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 Henda C. Swart. Henda C. Swart is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | A characterisation of eccentric sequences of maximal outerplanar graphs. | 1 |
| 2 | 25 | |
| 3 | 83 | |
| 4 | 11 | |
| 5 | 23 | |
| 6 | 58 | |
| 7 | 25 | |
| 8 | 16 | |
| 9 | On the graphs with maximum distance or $k$-diameter | 8 |
| 10 | 13 | |
| 11 | Twin Domination in Digraphs. | 19 |
| 12 | 10 | |
| 13 | Multipartite Ramsey Numbers. | 7 |
| 14 | Bounds on the Total Redundance and Efficiency of a Graph. | 4 |
| 15 | 23 | |
| 16 | 18 | |
| 17 | Relationships between distance domination parameters. | 4 |
| 18 | On the integrity of distance domination in graphs. | 14 |
| 19 | 2 | |
| 20 | 20 |
About Henda C. Swart
Henda C. Swart is a scholar working on Discrete Mathematics and Combinatorics, Computational Theory and Mathematics and Geometry and Topology, having authored 50 papers that have together received 663 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (38 papers), Graph theory and applications (21 papers) and Interconnection Networks and Systems (20 papers). The work is most often cited by research in Geometry and Topology (440 citations), Computational Theory and Mathematics (516 citations) and Discrete Mathematics and Combinatorics (102 citations). Henda C. Swart has collaborated with scholars based in South Africa, United States and Canada. Frequent co-authors include Peter Dankelmann, Simon Mukwembi, Ortrud R. Oellermann, Wayne Goddard, Michael A. Henning, İvan Gutman, David P. Day, R. C. Entringer, Johannes H. Hattingh and Paul van den Berg. Their work appears in journals such as Annals of the New York Academy of Sciences, Networks and Discrete Applied Mathematics.
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.