Register

JEST 2019

575 views
2 votes
2 votes
A directed graph with n vertices, in which each vertex has exactly 3 outgoing edges. Which one is true?

A) All the vertices have indegree = 3 .

B) Some vertices will have indegree exactly 3.

C)Some vertices have indegree atleast 3.

D) Some of the vertices have indegree atmost 3
User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

536
views
0 answers
0 votes
dan31 asked Feb 17, 2019
536 views
JEST 2019 Descriptive Q2 (8 Marks)
Given a sequence $a_1$, $a_2$ , $a_3$ ... $a_n$ of any different positive integers, exhibit an arrangement of integers between 1 and $n^2$ which has no increasing or decreasing subsequence of length n+1.
User Avatar
472
views
0 answers
1 votes
dan31 asked Feb 17, 2019
472 views
JEST 2019 Descriptive Q1 (8 Marks)
Suppose that G contains a cycle C, and a path of length at least k between some twovertices of C. Show that G contains a cycle of length at least √k.
User Avatar
581
views
2 answers
2 votes
Sayan Bose asked Feb 18, 2019
581 views
JEST 2019
Three dice are rolled independently. Probability of obtaining the difference from largest and smallest number as exactly 4 :
User Avatar
551
views
0 answers
2 votes
vivek_mishra asked Feb 17, 2019
551 views
JEST 2019
Let ${(0,1)}^n$ set of all binary string of length n. Hamming sphere of radius around a string C in ${(0,1)}^n$ is the set of all strings d$\epsilon$ ... S(C,k) and S(C',k) are disjointcouldn't remember rest of the options.
User Avatar
Link Copied!