Home > other >  A topic of discrete mathematics, bosses solve once!!
A topic of discrete mathematics, bosses solve once!!

Time:09-16

If a eulerian graph G, proof: for arbitrary point in G u, C (G - u) & lt;=d (u)/2,
  • Related