Charles L. Suffel

According to our database, Charles L. Suffel authored at least 20 papers between 1977 and 2013.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2013

On Component Order Edge Connectivity Of a Complete Bipartite Graph.

Daniel Gross, L. William Kazmierczak, John T. Saccoman, Charles L. Suffel, Antonius Suhartomo

Ars Comb., 2013

2009

A eulogy for Frank Boesch.

Charles L. Suffel

Networks, 2009

A survey of some network reliability analysis and synthesis results.

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

Networks, 2009

A generalization of an edge-connectivity theorem of Chartrand.

Frank Boesch, Daniel Gross, John T. Saccoman, L. William Kazmierczak, Charles L. Suffel, Antonius Suhartomo

Networks, 2009

2007

Realizability Results Involving Two Connectivity Parameters.

L. William Kazmierczak, Frank Boesch, Daniel Gross, Charles L. Suffel

Ars Comb., 2007

1998

On the characterization of graphs with maximum number of spanning trees.

Louis Petingi, Frank Boesch, Charles L. Suffel

Discret. Math., 1998

1996

A coherent model for reliability of multiprocessor networks.

Frank Boesch, Daniel Gross, Charles L. Suffel

IEEE Trans. Reliab., 1996

Cayley Graphs with Neighbor Connectivity One.

Lynne L. Doty, R. J. Goldstone, Charles L. Suffel

SIAM J. Discret. Math., 1996

1993

Computing Residual Connectedness Reliability for Restricted Networks.

Charles J. Colbourn, Appajosyula Satyanarayana, Charles L. Suffel, Klaus Sutner

Discret. Appl. Math., 1993

1992

A reliability-improving graph transformation with applications to network reliability.

Appajosyula Satyanarayana, L. Schoppmann, Charles L. Suffel

Networks, 1992

1991

The Complexity of the Residual Node Connectedness Reliability Problem.

Klaus Sutner, Appajosyula Satyanarayana, Charles L. Suffel

SIAM J. Comput., 1991

On the existence of uniformly optimally reliable networks.

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

Networks, 1991

1990

Least reliable networks and the reliability domination.

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

IEEE Trans. Commun., 1990

1989

On Residual Connectedness Network Reliability.

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

Proceedings of the Reliability Of Computer And Communication Networks, 1989

1985

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

Douglas Bauer, Frank Boesch, Charles L. Suffel, Ralph Tindell

Networks, 1985

1983

Domination alteration sets in graphs.

Douglas Bauer, Frank Harary, Juhani Nieminen, Charles L. Suffel

Discret. Math., 1983

1982

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

Francis T. Boesch, Charles L. Suffel

Networks, 1982

1981

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

Francis T. Boesch, Charles L. Suffel

Discret. Appl. Math., 1981

1980

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

Francis T. Boesch, Charles L. Suffel

J. Graph Theory, 1980

1977

The spanning subgraphs of eulerian graphs.

Francis T. Boesch, Charles L. Suffel, Ralph Tindell

J. Graph Theory, 1977