1 citations · 1 across the 1 of their papers we have counts for
1 paper
Suresh Badarla, R Rama
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 pick…