Affiliation:
1. Department of Mathematics and Computer Science Seton Hall University South Orange New Jersey USA
Subject
Computer Networks and Communications,Hardware and Architecture,Information Systems,Software
Reference49 articles.
1. Classes of uniformly most reliable graphs for all-terminal reliability
2. A generalization of an edge-connectivity theorem of Chartrand
3. Forbidden subgraph conditions on the complement of a graph that insure a strong network design;Boesch F.;Congr. Numer.,2003
4. Component order edge connectivity ‐ An introduction;Boesch F.;Congr. Numer.,2006
5. A coherent model for node reliability;Boesch F.;Congr. Numer.,1995