Lower bounds on the vulnerability of a graph. - Francis T. Boesch (Networks, 1972)

A general class of invulnerable graphs. - Francis T. Boesch; Alan P. Felzer (Networks, 1972)

Changing careers in science and engineering edited by Sanborn C. Brown, MIT Press, 1972, 349 pages. - Francis T. Boesch (Networks, 1973)

Covering Points of a Digraph with Point-Disjoint Paths and Its Application to Code Optimization. - Francis T. Boesch; James F. Gimpel (J. ACM, 1977)

The spanning subgraphs of eulerian graphs. - Francis T. Boesch; Charles L. Suffel; Ralph Tindell (J. Graph Theory, 1977)

Unicyclic realizability of a degree list. - Francis T. Boesch; Frank Harary (Networks, 1978)

Realizability of p-point graphs with prescribed minimum degree, maximum degree, and line connectivity. - Francis T. Boesch; Charles L. Suffel (J. Graph Theory, 1980)

Realizability of p-point graphs with prescribed minimum degree, maximum degree, and point-connectivity. - Francis T. Boesch; Charles L. Suffel (Discret. Appl. Math., 1981)

The cohesiveness of a point of a graph. - Jin Akiyama; Frank Boesch; Hiroshi Era; Frank Harary; Ralph Tindell (Networks, 1981)

Editorial. - Frank Boesch (Networks, 1981)

Graphs as models of communication network vulnerability: Connectivity and persistence. - Frank Boesch; Frank Harary; Jerald A. Kabell (Networks, 1981)

Realizability of p-point, q-line graphs with prescribed point connectivity, line connectivity, or minimum degree. - Francis T. Boesch; Charles L. Suffel (Networks, 1982)

Circulants and their connectivities. - Frank Boesch; Ralph Tindell (J. Graph Theory, 1984)

Reviews in graph theory, edited by William G. Brown, American Mathematical Society, 1980. Volumes I, II, III, IV (paperback). - Francis T. Boesch (Networks, 1984)

An edge extremal result for subcohesion. - Francis T. Boesch; James A. M. McHugh (J. Comb. Theory B, 1985)

Combinatorial optimization problems in the analysis and design of probabilistic networks. - Douglas Bauer; Frank Boesch; Charles L. Suffel; Ralph Tindell (Networks, 1985)

Spanning tree formulas and chebyshev polynomials. - Francis T. Boesch; Helmut Prodinger (Graphs Comb., 1986)

On unreliability polynomials and graph connectivity in reliable network synthesis. - Francis T. Boesch (J. Graph Theory, 1986)

On the synthesis of optimally reliable networks having unreliable nodes but reliable edges. - Francis T. Boesch (INFOCOM, 1988)

On Residual Connectedness Network Reliability. - Francis T. Boesch; Appajosyula Satyanarayana; Charles L. Suffel (Reliability Of Computer And Communication Networks, 1989)

Least reliable networks and the reliability domination. - Francis T. Boesch; Appajosyula Satyanarayana; Charles L. Suffel (IEEE Trans. Commun., 1990)

On the existence of uniformly optimally reliable networks. - Francis T. Boesch; Xiaoming Li 001; Charles L. Suffel (Networks, 1991)

Graphs with Most Number of Three Point Induced Connected Subgraphs. - Francis T. Boesch; Xiaoming Li 001; José Rodríguez (Discret. Appl. Math., 1995)

A coherent model for reliability of multiprocessor networks. - Frank Boesch; Daniel Gross; Charles L. Suffel (IEEE Trans. Reliab., 1996)

On the characterization of graphs with maximum number of spanning trees. - Louis Petingi; Frank Boesch; Charles L. Suffel (Discret. Math., 1998)

Realizability Results Involving Two Connectivity Parameters. - L. William Kazmierczak; Frank Boesch; Daniel Gross; Charles L. Suffel (Ars Comb., 2007)

A generalization of an edge-connectivity theorem of Chartrand. - Frank Boesch; Daniel Gross; John T. Saccoman; L. William Kazmierczak; Charles L. Suffel; Antonius Suhartomo (Networks, 2009)

A survey of some network reliability analysis and synthesis results. - Francis T. Boesch; Appajosyula Satyanarayana; Charles L. Suffel (Networks, 2009)