Charles L. Suffel

20 papers Journal 19Unranked 1
YearRankTypeTitle / Venue / Authors
2013 J jnl
On Component Order Edge Connectivity Of a Complete Bipartite Graph.
Ars Comb.
Daniel Gross, L. William Kazmierczak, John T. Saccoman, Charles L. Suffel, Antonius Suhartomo
2009 J jnl
A eulogy for Frank Boesch.
Networks
Charles L. Suffel
2009 J jnl
A generalization of an edge-connectivity theorem of Chartrand.
Networks
Frank Boesch, Daniel Gross, John T. Saccoman, L. William Kazmierczak, Charles L. Suffel, Antonius Suhartomo
2009 J jnl
A survey of some network reliability analysis and synthesis results.
Networks
Francis T. Boesch, Appajosyula Satyanarayana, Charles L. Suffel
2007 J jnl
Realizability Results Involving Two Connectivity Parameters.
Ars Comb.
L. William Kazmierczak, Frank Boesch, Daniel Gross, Charles L. Suffel
1998 J jnl
On the characterization of graphs with maximum number of spanning trees.
Discret. Math.
Louis Petingi, Frank Boesch, Charles L. Suffel
1996 J jnl
A coherent model for reliability of multiprocessor networks.
IEEE Trans. Reliab.
Frank Boesch, Daniel Gross, Charles L. Suffel
1996 J jnl
Cayley Graphs with Neighbor Connectivity One.
SIAM J. Discret. Math.
Lynne L. Doty, R. J. Goldstone, Charles L. Suffel
1993 J jnl
Computing Residual Connectedness Reliability for Restricted Networks.
Discret. Appl. Math.
Charles J. Colbourn, Appajosyula Satyanarayana, Charles L. Suffel, Klaus Sutner
1992 J jnl
A reliability-improving graph transformation with applications to network reliability.
Networks
Appajosyula Satyanarayana, L. Schoppmann, Charles L. Suffel
1991 J jnl
On the existence of uniformly optimally reliable networks.
Networks
Francis T. Boesch, Xiaoming Li, Charles L. Suffel
1991 J jnl
The Complexity of the Residual Node Connectedness Reliability Problem.
SIAM J. Comput.
Klaus Sutner, Appajosyula Satyanarayana, Charles L. Suffel
1990 J jnl
Least reliable networks and the reliability domination.
IEEE Trans. Commun.
Francis T. Boesch, Appajosyula Satyanarayana, Charles L. Suffel
1989 — conf
On Residual Connectedness Network Reliability.
Reliability Of Computer And Communication Networks
Francis T. Boesch, Appajosyula Satyanarayana, Charles L. Suffel
1985 J jnl
Combinatorial optimization problems in the analysis and design of probabilistic networks.
Networks
Douglas Bauer, Frank Boesch, Charles L. Suffel, Ralph Tindell
1983 J jnl
Domination alteration sets in graphs.
Discret. Math.
Douglas Bauer, Frank Harary, Juhani Nieminen, Charles L. Suffel
1982 J jnl
Realizability of
Networks
Francis T. Boesch, Charles L. Suffel
1981 J jnl
Realizability of p-point graphs with prescribed minimum degree, maximum degree, and point-connectivity.
Discret. Appl. Math.
Francis T. Boesch, Charles L. Suffel
1980 J jnl
Realizability of
J. Graph Theory
Francis T. Boesch, Charles L. Suffel
1977 J jnl
The spanning subgraphs of eulerian graphs.
J. Graph Theory
Francis T. Boesch, Charles L. Suffel, Ralph Tindell