Login / Signup

A remark on the number of vertices of degree k in a minimally k-edge-connected graph.

Mao-cheng Cai
Published in: Discret. Math. (1992)
Keyphrases
  • weighted graph
  • undirected graph
  • random graphs
  • edge weights
  • connected graphs
  • connected components
  • neural network
  • small number
  • maximum number
  • image processing
  • bayesian networks
  • computational complexity