Charles Suffel

Affiliations: 
Stevens Institute of Technology 
Area:
Mathematics
Google:
"Charles Suffel"
BETA: Related publications

Publications

You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect.

Gross D, Iswara L, Kazmierczak LW, et al. (2013) On component order edge reliability and the existence of uniformly most reliable unicycles Wseas Transactions On Mathematics. 12: 873-883
Gross D, Heinig M, Iswara L, et al. (2013) A survey of component order connectivity models of graph theoretic networks Wseas Transactions On Mathematics. 12: 895-910
Gross D, William Kazmierczak L, Saccoman JT, et al. (2013) On component order edge connectivity of a complete bipartite graph Ars Combinatoria. 112: 433-448
Boesch F, Gross D, Saccoman JT, et al. (2009) A generalization of an edge-connectivity theorem of Chartrand Networks. 54: 82-89
Petingi L, Boesch F, Suffel C. (1998) On the characterization of graphs with maximum number of spanning trees Discrete Mathematics. 179: 155-166
Doty LL, Goldstone RJ, Suffel CL. (1996) Cayley graphs with neighbor connectivity one Siam Journal On Discrete Mathematics. 9: 625-642
Boesch F, Suffel C, Tindell R, et al. (1993) The neighborhood inclusion structure of a graph Mathematical and Computer Modelling. 17: 25-28
Colbourn CJ, Satyanarayana A, Suffel C, et al. (1993) Computing residual connectedness reliability for restricted networks Discrete Applied Mathematics. 44: 221-232
Sutner K, Satyanarayana A, Suffel C. (1991) Complexity of the residual node connectedness reliability problem Siam Journal On Computing. 20: 149-155
Boesch FT, Satyanarayana A, Suffel CL. (1990) Least Reliable Networks and the Reliability Domination Ieee Transactions On Communications. 38: 2004-2009
See more...