Francis T. Boesch

Publication Activity (10 Years)

Years Active: 1972-2009
Publications (10 Years): 0

Publications

Francis T. Boesch, Appajosyula Satyanarayana, Charles L. Suffel
A survey of some network reliability analysis and synthesis results. Networks 54 (2) (2009)
Francis T. Boesch, Xiaoming Li, José Rodríguez
Graphs with Most Number of Three Point Induced Connected Subgraphs. Discret. Appl. Math. 59 (1) (1995)
Francis T. Boesch, Xiaoming Li, Charles L. Suffel
On the existence of uniformly optimally reliable networks. Networks 21 (2) (1991)
Francis T. Boesch, Appajosyula Satyanarayana, Charles L. Suffel
Least reliable networks and the reliability domination. IEEE Trans. Commun. 38 (11) (1990)
Francis T. Boesch, Appajosyula Satyanarayana, Charles L. Suffel
On Residual Connectedness Network Reliability. Reliability Of Computer And Communication Networks (1989)
Francis T. Boesch
On the synthesis of optimally reliable networks having unreliable nodes but reliable edges. INFOCOM (1988)
Francis T. Boesch, Helmut Prodinger
Spanning tree formulas and chebyshev polynomials. Graphs Comb. 2 (1) (1986)
Francis T. Boesch
On unreliability polynomials and graph connectivity in reliable network synthesis. J. Graph Theory 10 (3) (1986)
Francis T. Boesch, James A. M. McHugh
An edge extremal result for subcohesion. J. Comb. Theory, Ser. B 38 (1) (1985)
Francis T. Boesch
Reviews in graph theory, edited by William G. Brown, American Mathematical Society, 1980. Volumes I, II, III, IV (paperback). Networks 14 (1) (1984)
Francis T. Boesch, Charles L. Suffel
-line graphs with prescribed point connectivity, line connectivity, or minimum degree. Networks 12 (3) (1982)
Francis T. Boesch, Charles L. Suffel
Realizability of p-point graphs with prescribed minimum degree, maximum degree, and point-connectivity. Discret. Appl. Math. 3 (1) (1981)
Francis T. Boesch, Charles L. Suffel
-point graphs with prescribed minimum degree, maximum degree, and line connectivity. J. Graph Theory 4 (4) (1980)
Francis T. Boesch, Frank Harary
Unicyclic realizability of a degree list. Networks 8 (2) (1978)
Francis T. Boesch, Charles L. Suffel, Ralph Tindell
The spanning subgraphs of eulerian graphs. J. Graph Theory 1 (1) (1977)
Francis T. Boesch, James F. Gimpel
Covering Points of a Digraph with Point-Disjoint Paths and Its Application to Code Optimization. J. ACM 24 (2) (1977)
Francis T. Boesch
Changing careers in science and engineering edited by Sanborn C. Brown, MIT Press, 1972, 349 pages. Networks 3 (1) (1973)
Francis T. Boesch, Alan P. Felzer
A general class of invulnerable graphs. Networks 2 (3) (1972)
Francis T. Boesch
Lower bounds on the vulnerability of a graph. Networks 2 (4) (1972)