John Frederick Fink

638 citations
15 papers · 418 indexed · h-index 8
Topics
Advanced Graph Theory Research (10 papers)Graph theory and applications (8 papers)Graph Labeling and Dimension Problems (6 papers)
Partner nations
United States

In The Last Decade

John Frederick Fink

12 papers receiving 381 citations

Peers

John Frederick Fink
Comparison fields: 5 of 34
  • Computational Theory and Mathematics 379
  • Computer Networks and Communications 118
  • Geometry and Topology 118
  • Discrete Mathematics and Combinatorics 74
  • Electrical and Electronic Engineering 40
Replace Lael F. Kinch with:
Lael F. Kinch United States
Christina M. Mynhardt Canada
Fred Buckley United States
William F. Klostermeyer United States
E. Sampathkumar India
Curtiss E. Wall United States
Hadrien Mélot Belgium
B. Jamison United States
H. Abdollahzadeh Ahangar Iran
Ajai Kapoor Italy
John Frederick Fink relative to Lael F. Kinch United States Lael F. Kinch's profile →
Citations per field
00.5×1.5×2.5×
Lael F. Kinch · 1×
Citations per year

Countries citing papers authored by John Frederick Fink

Since Specialization
Citations

This map shows the geographic impact of John Frederick Fink'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 John Frederick Fink with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites John Frederick Fink more than expected).

Fields of papers citing papers by John Frederick Fink

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by John Frederick Fink. 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 John Frederick Fink. The network helps show where John Frederick Fink may publish in the future.

Co-authorship network of co-authors of John Frederick Fink

This figure shows the co-authorship network connecting the top 25 collaborators of John Frederick Fink. A scholar is included among the top collaborators of John Frederick Fink 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 John Frederick Fink. John Frederick Fink is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

15 of 15 papers shown
#WorkIndexed citations
1 10
2 11
3 9
4 2
5 91
6 17
7 1
8
n-Domination in graphs
105
9
On isopart parameters of complete bipartite graphs and $n$-cubes
0
10
On n-domination, n-dependence and forbidden subgraphs
53
11 108
12 0
13 1
14 3
15 7

About John Frederick Fink

John Frederick Fink is a scholar working on Discrete Mathematics and Combinatorics, Geometry and Topology and Computational Theory and Mathematics, having authored 15 papers that have together received 418 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (10 papers), Graph theory and applications (8 papers) and Graph Labeling and Dimension Problems (6 papers). The work is most often cited by research in Computational Theory and Mathematics (379 citations), Discrete Mathematics and Combinatorics (74 citations) and Geometry and Topology (118 citations). John Frederick Fink has collaborated with scholars based in United States. Frequent co-authors include Michael S. Jacobson, John A G Roberts, Lael F. Kinch, Ping Zhang and Gary Chartrand. Their work appears in journals such as Discrete Applied Mathematics, Discrete Mathematics and Journal of Combinatorial Theory Series B.

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.

Explore authors with similar magnitude of impact

Rankless by CCL
2026