Register
Webpage for Graph Theory:

Recent questions tagged graph-theory

11 votes
1 answer
661
GATE CSE 1987 | Question: 9d
Specify an adjacency-lists representation of the undirected graph given above.
Specify an adjacency-lists representation of the undirected graph given above.
User Avatar
15 votes
3 answers
662
GATE CSE 1987 | Question: 9c
Show that the number of odd-degree vertices in a finite graph is even.
Show that the number of odd-degree vertices in a finite graph is even.
User Avatar
0 votes
1 answer
664
ACE practice booklet vol-2 chapter-3, Q.8
If a tree T with n vertices is isomorphic to T bar (complement) then n =?
If a tree T with n vertices is isomorphic to T bar (complement) then n =?
User Avatar
0 votes
0 answers
665
GATE practice booklet - ACE engineering publication, chatper 3 q.7
how many simple non isomorphic graphs are possible with 9 vertices, 9 edges and degree of each vertex is 2?
how many simple non isomorphic graphs are possible with 9 vertices, 9 edges and degree of each vertex is 2?
User Avatar
2 votes
1 answer
667
DFS based question
How many times 8 is pushed into stack ? a detail answer will be welcomed.
How many times 8 is pushed into stack ? a detail answer will be welcomed.
User Avatar
0 votes
0 answers
668
Ace Graph Theory
How many times * is pushed into stack ? a detail answer will be welcomed.
How many times * is pushed into stack ? a detail answer will be welcomed.
User Avatar
2 votes
2 answers
669
GATE CSE 1987 | Question: 2f
State whether the following statements are TRUE or FALSE: Every infinite cyclic group is isomorphic to the infinite cyclic group of integers under addition.
State whether the following statements are TRUE or FALSE:Every infinite cyclic group is isomorphic to the infinite cyclic group of integers under addition.
User Avatar
4 votes
1 answer
670
GATE CSE 1987 | Question: 2e
State whether the following statement is TRUE or FALSE: There is a linear-time algorithm for testing the planarity of finite graphs.
State whether the following statement is TRUE or FALSE:There is a linear-time algorithm for testing the planarity of finite graphs.
User Avatar
0 votes
0 answers
671
Kerala PSC AP Exam
The maximum number of edges in an acyclic undirected graph with n vertices A) n - 1 B) n C) n +1 D) 2n -1
The maximum number of edges in an acyclic undirected graph with n verticesA) n - 1B) nC) n +1D) 2n -1
User Avatar
0 votes
0 answers
674
Discreate Math
What is even and odd permuatation function ? I saw some where (1,2,3) broken into even permutaion of (1,3) , (1,2) what is the logic behind it? PLz give reffrence too.
What is even and odd permuatation function ? I saw some where (1,2,3) broken into even permutaion of (1,3) , (1,2) what is the logic behind it? PLz give reffrence too.
User Avatar
1 votes
0 answers
675
Register Allocation
Do we have register interference graphs/ coloring in our syllabus and if so can someone please provide any online material for it.I am facing difficulty understanding how the graph is actually constructed.
Do we have register interference graphs/ coloring in our syllabus and if so can someone please provide any online material for it.I am facing difficulty understanding how...
User Avatar
1 votes
1 answer
676
Trees
There are nn-2 labeled trees with n vertices(n>2) Can anyone explain it with complete proof?
There are nn-2 labeled trees with n vertices(n>2)Can anyone explain it with complete proof?
User Avatar
1 votes
1 answer
680
Graphs
User Avatar
0 votes
3 answers
681
GATE Overflow | Data Structures | Test 1 | Question: 27
Consider a complete graph of 10 vertices. The minimum no. of edge removals required to make the graph disconnected is ______
Consider a complete graph of 10 vertices. The minimum no. of edge removals required to make the graph disconnected is ______
User Avatar
0 votes
2 answers
682
GATE Overflow | Data Structures | Test 1 | Question: 21
A vertex having no incident edge is called --------- pendent vertex end vertex isolated vertex none of these
A vertex having no incident edge is called -pendent vertex end vertexisolated vertex none of these
User Avatar
3 votes
1 answer
684
GATE Overflow | Data Structures | Test 1 | Question: 18
The maximum number of possible edges in an undirected simple graph with $100$ vertices and $5$ components is ___
The maximum number of possible edges in an undirected simple graph with $100$ vertices and $5$ components is ___
User Avatar
1 votes
2 answers
687
UGC NET CSE | December 2010 | Part 2 | Question: 4
The minimum number of edges in a connected graph with $‘n’$ vertices is equal to $n (n – 1)$ $\frac{n(n-1)}{2}$ $n^{2}$ $n – 1$
The minimum number of edges in a connected graph with $‘n’$ vertices is equal to$n (n – 1)$ $\frac{n(n-1)}{2}$$n^{2}$$n – 1$
User Avatar
2 votes
1 answer
688
UGC NET CSE | December 2010 | Part 2 | Question: 2
An undirected graph possesses an eulerian circuit if and only if it is connected and its vertices are All of even degree All of odd degree Of any degree Even in number
An undirected graph possesses an eulerian circuit if and only if it is connected and its vertices areAll of even degreeAll of odd degreeOf any degreeEven in number
User Avatar
1 votes
1 answer
689
Spanning trees
Find the number of spanning trees in the following graph;
Find the number of spanning trees in the following graph;
User Avatar
1 votes
0 answers
690
#Narsingh_Deo Chapter-2 problem 2-29
Show that in a dancing ring of n children it is always possible to arrange the children so that everyone has a friend at each side if every child enjoys friendship with at least half the children.
Show that in a dancing ring of n children it is always possible to arrange the children so that everyone has a friend at each side if every child enjoys friendship with a...
User Avatar
Page: