1,535 views
0 0 votes

i am getting 6 as answer

Please log in or register to answer this question.

Position:
Show:

Related questions

1 1 vote
1 1 answer
1.3k
1.3k views
pps121 asked Jan 8, 2019
1,286 views
Let $G$ be a graph on $n$ vertices with $4n-16$ edges.Consider the following:1. There is a vertex of degree smaller than $8$ in $G.$2. There is a vertex such that there a...
2 2 votes
1 answers 1 answer
1.7k
1.7k views
Prince Sindhiya asked Oct 15, 2018
1,715 views
Consider the following two statements$:$The two graphs $G_{1}$ and $G_{2}$ are isomorphicEach of $G_{1}$ and $G_{2}$ are self-dual. Both $(i)$ and $(ii)$ are trueOnly $(i...
0 0 votes
1 1 answer
799
799 views
kunalv asked Sep 10, 2017
799 views
Which of the following is true?The size of the maximum independent set on G is the same as the size of maximum clique on G'(Complement of G)The size of minimum vertex cov...
4 4 votes
1 answers 1 answer
2.0k
2.0k views
Samujjal Das asked Jan 24, 2017
1,991 views
A complete graph on $n$ vertices is an undirected graph in which every pair of distinct vertices is connected by an edge. A simple path in a graph is one in which no vert...