The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
Facebook Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
Recent questions tagged eulergraph
+1
vote
2
answers
1
Graph Connectivity
Consider the given statements S1: In a simple graph G with 6 vertices, if degree of each vertex is 2, then Euler circuit exists in G. S2:In a simple graph G, if degree of each vertex is 3 then the graph G is connected. Which of the following is/are true?
asked
Nov 6, 2018
in
Graph Theory
by
dan31
Junior
(
869
points)

225
views
graphtheory
eulergraph
graphconnectivity
+2
votes
1
answer
2
Euler Path
Which of the following Graph has Euler Path but is not an Euler Graph? A. K1,1 B.K2,10 C.K2,11 D.K10,11.
asked
Jan 31, 2017
in
Graph Theory
by
Jason GATE
Active
(
3.7k
points)

384
views
graphtheory
eulergraph
eulerpath
+5
votes
1
answer
3
TIFR2016B9
Which of the following graphs DOES NOT have an Eulerian circuit? (Recall that an Eulerian circuit in an undirected graph is a walk in the graph that starts at a vertex ans returns to the vertex after tracelling on each edge exactly once.) $K_{9, 9}$ $K_{8, 8}$ $K_{12, 12}$ $K_9$ The graph $G$ on vertex ...
asked
Dec 29, 2016
in
Others
by
jothee
Veteran
(
104k
points)

270
views
tifr2016
discretemathematics
graphtheory
eulergraph
normal
+2
votes
1
answer
4
graph theory
asked
Dec 28, 2016
in
Graph Theory
by
thor
Loyal
(
6.7k
points)

471
views
graphtheory
graphconnectivity
eulergraph
+6
votes
2
answers
5
Graph connectivity
asked
Oct 10, 2016
in
Graph Theory
by
Rahul Jain25
Boss
(
11k
points)

392
views
graphtheory
graphconnectivity
eulergraph
+1
vote
1
answer
6
Graphs
asked
Oct 10, 2016
in
Graph Theory
by
Rahul Jain25
Boss
(
11k
points)

91
views
graphtheory
cycle
eulergraph
+1
vote
1
answer
7
UGCNETAUG2016II5
Given the following graphs : $(G_{1})$ $(G_{2})$ Which of the following is correct ? $G_{1}$ contains Euler circuit and $(G_{2})$ does not contain Euler circuit. $(G_{1})$ does not contain Euler circuit and $(G_{2})$ contains Euler circuit. Both $(G_{1})$ and $(G_{2})$ do not contain Euler circuit. Both $(G_{1})$ and $(G_{2})$ contain Euler circuit.
asked
Sep 24, 2016
in
Others
by
makhdoom ghaya
Boss
(
29.9k
points)

805
views
ugcnetaug2016ii
graphtheory
eulergraph
0
votes
2
answers
8
UGCNETDec2010II2
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
asked
Sep 5, 2016
in
Graph Theory
by
makhdoom ghaya
Boss
(
29.9k
points)

665
views
ugcnetdec2010ii
graphtheory
eulergraph
+6
votes
4
answers
9
ISRO20165
A given connected graph $G$ is a Euler Graph if and only if all vertices of $G$ are of same degree even degree odd degree different degree
asked
Jul 4, 2016
in
Graph Theory
by
asu
Boss
(
11k
points)

3.2k
views
graphtheory
eulergraph
isro2016
To see more, click for the
full list of questions
or
popular tags
.
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
TIFR and JEST exam
Minimal Deterministic Finite Automata
To be aware of fake GATE test series
Standard Book Exercise Questions for Computer Science
Resource to Learn Graph Theory Interactively
Follow @csegate
Recent questions tagged eulergraph
Recent Blog Comments
Thank you, Lakshman. Keep up the good work.
Is NOC need to send via registered post only? Or...
ok sir , I am resending it
@someearth I havent received it. It the...
I thought our data was sent to them by coaching...
50,666
questions
56,131
answers
193,669
comments
93,304
users