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

1 Answer

+2 votes

choose any set of vertex you always get complete graph .

by Veteran (63.8k points)
edited by
@Anirudh. You have primitively taken complete graph. But it can any 'n' regular.

Related questions

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,834 questions
57,854 answers
108,397 users