Graph Theory, Diestel Solution(Ongoing Note) - IIT Guwahati

May 1, 2016 ... and second vertices, answer is n ? 3, and so on. Thus total number of edge is Kn is. (n ? 1) + (n ? 2) + ··· +1+0= n(n ? 1). 2 . Exercise 1.2. Determine the average degree, number of edges, diameter, girth, and circumference of the hypercube graph Qd. Proof. Since V is the set of all 0 ? 1 sequences of length ...


Un extrait du document