Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Webpage for Graph Theory:
Recent questions tagged graph-theory
54
votes
7
answers
871
GATE CSE 2009 | Question: 3
Which one of the following is TRUE for any simple connected undirected graph with more than $2$ vertices? No two vertices have the same degree. At least two vertices have the same degree. At least three vertices have the same degree. All vertices have the same degree.
Which one of the following is TRUE for any simple connected undirected graph with more than $2$ vertices? No two vertices have the same degree. At least two vertices ...
gatecse
11.5k
views
gatecse
asked
Sep 15, 2014
Graph Theory
gatecse-2009
graph-theory
normal
degree-of-graph
+
–
49
votes
11
answers
872
GATE CSE 2009 | Question: 2
What is the chromatic number of an $n$ vertex simple connected graph which does not contain any odd length cycle? Assume $n > 2$. $2$ $3$ $n-1$ $n$
What is the chromatic number of an $n$ vertex simple connected graph which does not contain any odd length cycle? Assume $n 2$.$2$$3$$n-1$ $n$
gatecse
13.3k
views
gatecse
asked
Sep 15, 2014
Graph Theory
gatecse-2009
graph-theory
graph-coloring
normal
+
–
54
votes
6
answers
873
GATE CSE 2001 | Question: 2.15
How many undirected graphs (not necessarily connected) can be constructed out of a given set $V=\{v_1, v_2, \dots v_n\}$ of $n$ vertices? $\frac{n(n-1)} {2}$ $2^n$ $n!$ $2^\frac{n(n-1)} {2} $
How many undirected graphs (not necessarily connected) can be constructed out of a given set $V=\{v_1, v_2, \dots v_n\}$ of $n$ vertices?$\frac{n(n-1)} {2}$$2^n$$n!$$2^\f...
Kathleen
14.3k
views
Kathleen
asked
Sep 14, 2014
Graph Theory
gatecse-2001
graph-theory
normal
counting
+
–
33
votes
3
answers
874
GATE CSE 1992 | Question: 03,iii
How many edges can there be in a forest with $p$ components having $n$ vertices in all?
How many edges can there be in a forest with $p$ components having $n$ vertices in all?
Kathleen
6.5k
views
Kathleen
asked
Sep 13, 2014
Graph Theory
gate1992
graph-theory
graph-connectivity
descriptive
+
–
9
votes
4
answers
875
GATE CSE 1992 | Question: 02,viii
A non-planar graph with minimum number of vertices has $9$ edges, $6$ vertices $6$ edges, $4$ vertices $10$ edges, $5$ vertices $9$ edges, $5$ vertices
A non-planar graph with minimum number of vertices has$9$ edges, $6$ vertices$6$ edges, $4$ vertices$10$ edges, $5$ vertices$9$ edges, $5$ vertices
Kathleen
3.2k
views
Kathleen
asked
Sep 12, 2014
Graph Theory
gate1992
graph-theory
normal
graph-planarity
+
–
10
votes
1
answer
876
GATE CSE 1992 | Question: 01,x
Maximum number of edges in a planar graph with $n$ vertices is _____
Maximum number of edges in a planar graph with $n$ vertices is _____
Kathleen
5.6k
views
Kathleen
asked
Sep 12, 2014
Graph Theory
gate1992
graph-theory
graph-planarity
easy
fill-in-the-blanks
+
–
51
votes
4
answers
877
GATE CSE 1991 | Question: 01,xv
The maximum number of possible edges in an undirected graph with $n$ vertices and $k$ components is ______.
The maximum number of possible edges in an undirected graph with $n$ vertices and $k$ components is ______.
Kathleen
11.7k
views
Kathleen
asked
Sep 12, 2014
Graph Theory
gate1991
graph-theory
graph-connectivity
normal
fill-in-the-blanks
+
–
113
votes
9
answers
878
GATE CSE 2012 | Question: 38
Let $G$ be a complete undirected graph on $6$ vertices. If vertices of $G$ are labeled, then the number of distinct cycles of length $4$ in $G$ is equal to $15$ $30$ $90$ $360$
Let $G$ be a complete undirected graph on $6$ vertices. If vertices of $G$ are labeled, then the number of distinct cycles of length $4$ in $G$ is equal to$15$$30$$90$$36...
gatecse
35.1k
views
gatecse
asked
Sep 12, 2014
Graph Theory
gatecse-2012
graph-theory
normal
marks-to-all
counting
+
–
39
votes
7
answers
879
GATE CSE 2008 | Question: 23
Which of the following statements is true for every planar graph on $n$ vertices? The graph is connected The graph is Eulerian The graph has a vertex-cover of size at most $\frac{3n}{4}$ The graph has an independent set of size at least $\frac{n}{3}$
Which of the following statements is true for every planar graph on $n$ vertices?The graph is connectedThe graph is EulerianThe graph has a vertex-cover of size at most $...
Kathleen
65.2k
views
Kathleen
asked
Sep 11, 2014
Graph Theory
gatecse-2008
graph-theory
normal
graph-planarity
+
–
26
votes
3
answers
880
GATE CSE 2012 | Question: 17
Let $G$ be a simple undirected planar graph on $10$ vertices with $15$ edges. If $G$ is a connected graph, then the number of bounded faces in any embedding of $G$ on the plane is equal to $3$ $4$ $5$ $6$
Let $G$ be a simple undirected planar graph on $10$ vertices with $15$ edges. If $G$ is a connected graph, then the number of bounded faces in any embedding of $G$ on the...
gatecse
10.1k
views
gatecse
asked
Aug 5, 2014
Graph Theory
gatecse-2012
graph-theory
graph-planarity
normal
+
–
Page:
« prev
1
...
25
26
27
28
29
30
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register