Suresh Badarla

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
A k-tree is either a complete graph on (k+1) vertices or given a k-tree G′ with n vertices, a k-tree G with (n+1) vertices can be constructed by introducing a new vertex v and picking a k-clique Q in G′ and then joining each vertex u in Q. A graph G is k-edge-connected if the graph remains connected even after deleting fewer edges than k from the graph. A(More)
  • 1