1,406 views

3 Answers

4 votes
4 votes

A) Definitely a complete graph because a graph having one vertex is trivial and hence implicitly complete.

B) Yes it is a clique because the vertex forms subgraph of the graph itself and as the subgraph is complete trivially, it is a clique. Please note that C ⊆ V denotes that C is subset of V and not PROPER subset of V hence both C and V contains the single Vertex.

C) Yes it is connected as well. Because a graph having one vertex is implicitly connected. 

1 votes
1 votes

It's not a complete graph because property of a complete graph is

Kn has n(n − 1)/2 edges (a triangular number), and is a regular graph of degree n − 1.

here n=1 so 1*(1-1)/2 is not defined so it is not a complete graph

It's not clique because the definition of clique is

cliqueC, in an undirected graph G = (VE) is a subset of the vertices, C ⊆ V, such that every two distinct vertices are adjacent. This is equivalent to the condition that the induced subgraph of G induced by C is a complete graph. In some cases, the term clique may also refer to the subgraph directly.

there is no subgraph in given graph which is complete

It's not connected graph because according to definition a graph should have atleast two vertices to show it is connected or not

Defination: A graph is connected when there is a path between every pair of vertices

in the question it is only mentioned that there is one vertex 

0 votes
0 votes
According to defination, All three are correct.

Related questions

0 votes
0 votes
0 answers
1
0 votes
0 votes
0 answers
2
Pavan Kumar Munnam asked May 12, 2017
376 views
algorithm to find more than one path between any two vertices of a graph G=(V,E) , with a complexity of O(VE) ?
0 votes
0 votes
1 answer
3
1 votes
1 votes
4 answers
4
Vicky rix asked Mar 11, 2017
3,414 views
chromatic number of a graph <= ( maxdegree of the graph ) + 1 can somebody explain how ?