F Boesch

2.3k total citations
50 papers, 1.5k citations indexed

About

F Boesch is a scholar working on Computer Networks and Communications, Computational Theory and Mathematics and Geometry and Topology. According to data from OpenAlex, F Boesch has authored 50 papers receiving a total of 1.5k indexed citations (citations by other indexed papers that have themselves been cited), including 24 papers in Computer Networks and Communications, 24 papers in Computational Theory and Mathematics and 19 papers in Geometry and Topology. Recurrent topics in F Boesch's work include Interconnection Networks and Systems (20 papers), Advanced Graph Theory Research (20 papers) and Graph theory and applications (19 papers). F Boesch is often cited by papers focused on Interconnection Networks and Systems (20 papers), Advanced Graph Theory Research (20 papers) and Graph theory and applications (19 papers). F Boesch collaborates with scholars based in United States, Taiwan and Austria. F Boesch's co-authors include Ralph Tindell, C Suffel, Jhing-Fa Wang, Helmut Prodinger, A. Satyanarayana, James F. Gimpel, Frank Harary, Robin Thomas, Douglas C. Bauer and Zbigniew R. Bogdanowicz and has published in prestigious journals such as IEEE Transactions on Communications, Journal of the ACM and American Mathematical Monthly.

In The Last Decade

F Boesch

47 papers receiving 1.4k citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
F Boesch United States	23	833	786	495	357	178	50	1.5k
Gerard J. Chang Taiwan	30	2.3k 2.8×	879 1.1×	562 1.1×	744 2.1×	512 2.9×	195	3.1k
Eddie Cheng United States	28	962 1.2×	2.1k 2.7×	457 0.9×	772 2.2×	36 0.2×	176	2.4k
Jimmy J.M. Tan Taiwan	28	812 1.0×	2.1k 2.7×	315 0.6×	1.0k 2.8×	22 0.1×	94	2.3k
Gen-Huey Chen Taiwan	24	480 0.6×	1.7k 2.1×	97 0.2×	961 2.7×	18 0.1×	136	2.2k
András Frank Hungary	26	1.4k 1.7×	765 1.0×	72 0.1×	326 0.9×	138 0.8×	69	1.8k
N. S. Mendelsohn Canada	17	436 0.5×	85 0.1×	211 0.4×	500 1.4×	169 0.9×	81	1.1k
Edward F. Moore United States	9	301 0.4×	170 0.2×	50 0.1×	207 0.6×	14 0.1×	14	833
Behrooz Parhami United States	18	275 0.3×	833 1.1×	70 0.1×	471 1.3×	9 0.1×	125	1.3k
K. Thulasiraman United States	17	227 0.3×	579 0.7×	82 0.2×	500 1.4×	9 0.1×	101	1.1k
Michael Jünger Germany	16	530 0.6×	244 0.3×	14 0.0×	218 0.6×	49 0.3×	30	1.4k

Countries citing papers authored by F Boesch

Since Specialization

Citations

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

Fields of papers citing papers by F Boesch

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of F Boesch

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

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

1.

Boesch, F, et al.. (2009). A generalization of an edge‐connectivity theorem of Chartrand. Networks. 54(2). 82–89.

2.

Boesch, F, et al.. (2007). Realizability Results Involving Two Connectivity Parameters.. Ars Combinatoria. 82.

3.

Boesch, F, et al.. (1998). On the characterization of graphs with maximum number of spanning trees. Discrete Mathematics. 179(1-3). 155–166. 32 indexed citations

4.

Boesch, F, et al.. (1995). Graphs with most number of three point induced connected subgraphs. Discrete Applied Mathematics. 59(1). 1–10.

5.

Boesch, F, C Suffel, Ralph Tindell, & Frank Harary. (1993). The neighborhood inclusion structure of a graph. Mathematical and Computer Modelling. 17(11). 25–28. 8 indexed citations

6.

Yang, C.S., et al.. (1988). Graph theoretic reliability analysis for the Boolean n cube networks. IEEE Transactions on Circuits and Systems. 35(9). 1175–1179. 24 indexed citations

7.

Yang, C.S., et al.. (1988). The number of spanning trees of the regular networks. International Journal of Computer Mathematics. 23(3-4). 185–200. 8 indexed citations

8.

Yang, C.S., et al.. (1987). Reliability properties of the hypercube network. Computers & Mathematics with Applications. 14(7). 541–548. 2 indexed citations

9.

Boesch, F. (1986). On unreliability polynomials and graph connectivity in reliable network synthesis. Journal of Graph Theory. 10(3). 339–352. 95 indexed citations

10.

Boesch, F. (1986). Synthesis of reliable networks - a survey. IEEE Transactions on Reliability. 35(3). 240–246. 141 indexed citations

11.

Prodinger, Helmut, et al.. (1985). The Number of Spanning Trees in the Square of a Cycle. The Fibonacci quarterly. 23(3). 258–264. 11 indexed citations

12.

Bauer, Douglas C., F Boesch, C Suffel, & Ralph Tindell. (1985). Combinatorial optimization problems in the analysis and design of probabilistic networks. Networks. 15(2). 257–271. 55 indexed citations

13.

Boesch, F & James A. M. McHugh. (1985). An edge extremal result for subcohesion. Journal of Combinatorial Theory Series B. 38(1). 1–7. 5 indexed citations

14.

Boesch, F & Ralph Tindell. (1984). Circulants and their connectivities. Journal of Graph Theory. 8(4). 487–499. 234 indexed citations

15.

Boesch, F & C Suffel. (1981). Realizability of p-point graphs with prescribed minimum degree, maximum degree, and point-connectivity. Discrete Applied Mathematics. 3(1). 9–18. 5 indexed citations

16.

Boesch, F. (1974). The strongest monotone degree condition for n-connectedness of a graph. Journal of Combinatorial Theory Series B. 16(2). 162–165. 17 indexed citations

17.

Boesch, F. (1972). Lower bounds on the vulnerability of a graph. Networks. 2(4). 329–340. 6 indexed citations

18.

Boesch, F, et al.. (1971). On the Invulnerability of the Regular Complete k-Partite Graphs. SIAM Journal on Applied Mathematics. 20(2). 176–182. 30 indexed citations

19.

Boesch, F, et al.. (1971). Minimum total capacitance RC realizations. IEEE Transactions on Circuit Theory. 18(2). 286–288. 7 indexed citations

20.

Boesch, F. (1969). Properties of the distance matrix of a tree. Quarterly of Applied Mathematics. 26(4). 607–609. 22 indexed citations

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