Francis T. Boesch

According to our database1, Francis T. Boesch authored at least 27 papers between 1972 and 2009.

Collaborative distances:

Awards

IEEE Fellow

IEEE Fellow 1979, "For contributions to the application of network theory to invulnerable communication nets".

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2009
A survey of some network reliability analysis and synthesis results.
Networks, 2009

A generalization of an edge-connectivity theorem of Chartrand.
Networks, 2009

2007
Realizability Results Involving Two Connectivity Parameters.
Ars Comb., 2007

1998
On the characterization of graphs with maximum number of spanning trees.
Discret. Math., 1998

1996
A coherent model for reliability of multiprocessor networks.
IEEE Trans. Reliab., 1996

1995
Graphs with Most Number of Three Point Induced Connected Subgraphs.
Discret. Appl. Math., 1995

1991
On the existence of uniformly optimally reliable networks.
Networks, 1991

1990
Least reliable networks and the reliability domination.
IEEE Trans. Commun., 1990

1989
On Residual Connectedness Network Reliability.
Proceedings of the Reliability Of Computer And Communication Networks, 1989

1986
On unreliability polynomials and graph connectivity in reliable network synthesis.
J. Graph Theory, 1986

Spanning tree formulas and chebyshev polynomials.
Graphs Comb., 1986

1985
Combinatorial optimization problems in the analysis and design of probabilistic networks.
Networks, 1985

An edge extremal result for subcohesion.
J. Comb. Theory, Ser. B, 1985

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

Circulants and their connectivities.
J. Graph Theory, 1984

1982
Realizability of <i>p</i>-point, <i>q</i>-line graphs with prescribed point connectivity, line connectivity, or minimum degree.
Networks, 1982

1981
Graphs as models of communication network vulnerability: Connectivity and persistence.
Networks, 1981

Editorial.
Networks, 1981

The cohesiveness of a point of a graph.
Networks, 1981

Realizability of p-point graphs with prescribed minimum degree, maximum degree, and point-connectivity.
Discret. Appl. Math., 1981

1980
Realizability of <i>p</i>-point graphs with prescribed minimum degree, maximum degree, and line connectivity.
J. Graph Theory, 1980

1978
Unicyclic realizability of a degree list.
Networks, 1978

1977
The spanning subgraphs of eulerian graphs.
J. Graph Theory, 1977

Covering Points of a Digraph with Point-Disjoint Paths and Its Application to Code Optimization.
J. ACM, 1977

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

1972
A general class of invulnerable graphs.
Networks, 1972

Lower bounds on the vulnerability of a graph.
Networks, 1972


  Loading...