2 votes 2 votes Let n be a positive integer. Show that a subgraph induced by a nonempty subset of the vertex set of Kn is a complete graph. Graph Theory graph-theory + – sourav. asked Aug 10, 2016 sourav. 1.1k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
2 votes 2 votes choose any set of vertex you always get complete graph . Prashant. answered Aug 10, 2016 • edited Aug 10, 2016 by Prashant. Prashant. comment Share Follow See 1 comment See all 1 1 comment reply Sushant Gokhale commented Sep 9, 2016 reply Follow Share @Anirudh. You have primitively taken complete graph. But it can any 'n' regular. –1 votes –1 votes Please log in or register to add a comment.
