Francis T. Boesch

发表

The cohesiveness of a point of a graph

Frank Harary, Jin Akiyama, Ralph Tindell, 1981, Networks.

Graphs as models of communication network vulnerability: Connectivity and persistence

Frank Harary, Jerald A. Kabell, Francis T. Boesch, 1981, Networks.

Realizability of p-point graphs with prescribed minimum degree, maximum degree, and point-connectivity

Charles L. Suffel, Francis T. Boesch, 1981, Discret. Appl. Math..

Realizability Results Involving Two Connectivity Parameters

Daniel Gross, Charles L. Suffel, Francis T. Boesch, 2007, Ars Comb..

Reviews in graph theory, edited by William G. Brown, American Mathematical Society, 1980. Volumes I, II, III, IV (paperback)

Francis T. Boesch, 1984, Networks.

A generalization of an edge-connectivity theorem of Chartrand

Daniel Gross, Charles L. Suffel, John T. Saccoman, 2009, Networks.

Unicyclic realizability of a degree list

Frank Harary, Francis T. Boesch, 1978, Networks.

A general class of invulnerable graphs

Francis T. Boesch, Alan P. Felzer, 1972, Networks.

Realizability of p-point graphs with prescribed minimum degree, maximum degree, and line connectivity

Charles L. Suffel, Francis T. Boesch, 1980, J. Graph Theory.

Graphs with Most Number of Three Point Induced Connected Subgraphs

José Rodríguez, Xiaoming Li, Francis T. Boesch, 1995, Discret. Appl. Math..

Spanning tree formulas and chebyshev polynomials

Helmut Prodinger, Francis T. Boesch, F. Boesch, 1986, Graphs Comb..

A coherent model for reliability of multiprocessor networks

Daniel Gross, Charles L. Suffel, Francis T. Boesch, 1996, IEEE Trans. Reliab..

Reliable circulant networks with minimum transmission delay

Jhing-Fa Wang, Francis T. Boesch, F. Boesch, 1985 .

Lower bounds on the vulnerability of a graph

Francis T. Boesch, 1972, Networks.

Realizability of p-point, q-line graphs with prescribed point connectivity, line connectivity, or minimum degree

Charles L. Suffel, Francis T. Boesch, 1982, Networks.

A survey of some network reliability analysis and synthesis results

Appajosyula Satyanarayana, Charles L. Suffel, Francis T. Boesch, 2009, Networks.

Large-scale networks : theory and design

Ieee Circuits, Francis T. Boesch, 1976 .

On Residual Connectedness Network Reliability

Appajosyula Satyanarayana, Charles L. Suffel, Francis T. Boesch, 1989, Reliability Of Computer And Communication Networks.

Network reliability - the state of the art foreword

Francis T. Boesch, 1986, IEEE Transactions on Reliability.

On the characterization of graphs with maximum number of spanning trees

Charles L. Suffel, Louis Petingi, Francis T. Boesch, 1998, Discret. Math..

Combinatorial optimization problems in the analysis and design of probabilistic networks

Douglas Bauer, Charles L. Suffel, Ralph Tindell, 1985, Networks.

On the existence of uniformly optimally reliable networks

Xiaoming Li, Charles L. Suffel, Francis T. Boesch, 1991, Networks.

Covering Points of a Digraph with Point-Disjoint Paths and Its Application to Code Optimization

James F. Gimpel, Francis T. Boesch, F. Boesch, 1977, JACM.

The spanning subgraphs of eulerian graphs

Charles L. Suffel, Ralph Tindell, Francis T. Boesch, 1977, J. Graph Theory.

An edge extremal result for subcohesion

James A. M. McHugh, Francis T. Boesch, J. A. McHugh, 1985, J. Comb. Theory, Ser. B.

Changing careers in science and engineering edited by Sanborn C. Brown, MIT Press, 1972, 349 pages

Francis T. Boesch, 1973, Networks.

Least reliable networks and the reliability domination

Appajosyula Satyanarayana, Charles L. Suffel, Francis T. Boesch, 1990, IEEE Trans. Commun..

On unreliability polynomials and graph connectivity in reliable network synthesis

Francis T. Boesch, F. Boesch, 1986, J. Graph Theory.

Network Reliability TheState oftheArt Foreword

Francis T. Boesch, 1986 .