Charles L. Suffel

Publication Activity (10 Years)

Years Active: 1977-2013
Publications (10 Years): 0

Top Topics

Bipartite Graph

Top Venues

Publications

Daniel Gross, L. William Kazmierczak, John T. Saccoman, Charles L. Suffel, Antonius Suhartomo
On Component Order Edge Connectivity Of a Complete Bipartite Graph. Ars Comb. 112 (2013)
Francis T. Boesch, Appajosyula Satyanarayana, Charles L. Suffel
A survey of some network reliability analysis and synthesis results. Networks 54 (2) (2009)
Frank Boesch, Daniel Gross, John T. Saccoman, L. William Kazmierczak, Charles L. Suffel, Antonius Suhartomo
A generalization of an edge-connectivity theorem of Chartrand. Networks 54 (2) (2009)
Charles L. Suffel
A eulogy for Frank Boesch. Networks 54 (2) (2009)
L. William Kazmierczak, Frank Boesch, Daniel Gross, Charles L. Suffel
Realizability Results Involving Two Connectivity Parameters. Ars Comb. 82 (2007)
Louis Petingi, Frank Boesch, Charles L. Suffel
On the characterization of graphs with maximum number of spanning trees. Discret. Math. 179 (1-3) (1998)
Frank Boesch, Daniel Gross, Charles L. Suffel
A coherent model for reliability of multiprocessor networks. IEEE Trans. Reliab. 45 (4) (1996)
Lynne L. Doty, R. J. Goldstone, Charles L. Suffel
Cayley Graphs with Neighbor Connectivity One. SIAM J. Discret. Math. 9 (4) (1996)
Charles J. Colbourn, Appajosyula Satyanarayana, Charles L. Suffel, Klaus Sutner
Computing Residual Connectedness Reliability for Restricted Networks. Discret. Appl. Math. 44 (1-3) (1993)
Appajosyula Satyanarayana, L. Schoppmann, Charles L. Suffel
A reliability-improving graph transformation with applications to network reliability. Networks 22 (2) (1992)
Francis T. Boesch, Xiaoming Li, Charles L. Suffel
On the existence of uniformly optimally reliable networks. Networks 21 (2) (1991)
Klaus Sutner, Appajosyula Satyanarayana, Charles L. Suffel
The Complexity of the Residual Node Connectedness Reliability Problem. SIAM J. Comput. 20 (1) (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)
Douglas Bauer, Frank Boesch, Charles L. Suffel, Ralph Tindell
Combinatorial optimization problems in the analysis and design of probabilistic networks. Networks 15 (2) (1985)
Douglas Bauer, Frank Harary, Juhani Nieminen, Charles L. Suffel
Domination alteration sets in graphs. Discret. Math. 47 (1983)
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, Charles L. Suffel, Ralph Tindell
The spanning subgraphs of eulerian graphs. J. Graph Theory 1 (1) (1977)