The Gateway to Computer Science Excellence
+2 votes
527 views
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.
in Graph Theory by Boss (16.1k points) | 527 views

1 Answer

+2 votes

choose any set of vertex you always get complete graph .

by Veteran (62.7k points)
edited by
–1
@Anirudh. You have primitively taken complete graph. But it can any 'n' regular.
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,645 questions
56,542 answers
195,693 comments
101,538 users