Combinatorial optimization problems in the analysis and design of probabilistic networks

This publication has 6 references indexed in Scilit:

• Circulants and their connectivities
  Journal of Graph Theory, 1984
• The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
  SIAM Journal on Computing, 1983
• Calculating bounds on reachability and connectedness in stochastic networks
  Networks, 1983
• A general class of invulnerable graphs
  Networks, 1972
• GRAPH THEORY
  Published by Defense Technical Information Center (DTIC) ,1969
• THE MAXIMUM CONNECTIVITY OF A GRAPH
  Proceedings of the National Academy of Sciences, 1962