Register

gatebook

221 views
2 votes
2 votes

how they are drawing DAG.Can someone explain?

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

0 votes
0 votes
0 answers
1
Niharika 1 asked Oct 29, 2017
208 views
gatebook
I checked with handshaking lemma I got 3 are not trees. I added all the degree sequence and equalized with 2* no of vertices -1 because if it is tree no of edges = no of vertices -1.Then no sequence is tree. Is it the way to do?
I checked with handshaking lemma I got 3 are not trees. I added all the degree sequence and equalized with 2* no of vertices -1 because if it is tree no of edges = no of ...
User Avatar
0 votes
0 votes
1 answer
2
Niharika 1 asked Oct 29, 2017
461 views
gatebook
Answer is c right and it is bipartite graph?
Answer is c right and it is bipartite graph?
User Avatar
1 votes
1 votes
1 answer
3
Niharika 1 asked Oct 28, 2017
356 views
gatebook
What is order means here and how to solve this?
What is order means here and how to solve this?
User Avatar
1 votes
1 votes
1 answer
4
Niharika 1 asked Oct 28, 2017
594 views
gatebook
If they asked maximum independent set of complement bipartite graph then answer will be 2 right?? And for bipartite graph it will be max(m,n)
If they asked maximum independent set of complement bipartite graph then answer will be 2 right?? And for bipartite graph it will be max(m,n)
User Avatar
Link Copied!