Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Recent questions tagged euler-graph
0
votes
1
answer
1
NIELIT 2017 July Scientist B (IT) - Section B: 7
Which of the following statements is/are TRUE? $S1$:The existence of an Euler circuit implies that an Euler path exists. $S2$:The existence of an Euler path implies that an Euler circuit exists. $S1$ is true. $S2$ is true. $S1$ and $S2$ both are true. $S1$ and $S2$ both are false.
Lakshman Patel RJIT
asked
in
Graph Theory
Mar 30, 2020
by
Lakshman Patel RJIT
1.2k
views
nielit2017july-scientistb-it
discrete-mathematics
graph-theory
euler-graph
0
votes
3
answers
2
NIELIT 2017 July Scientist B (CS) - Section B: 12
The following graph has no Euler circuit because It has $7$ vertices. It is even-valent (all vertices have even valence). It is not connected. It does not have a Euler circuit.
Lakshman Patel RJIT
asked
in
Graph Theory
Mar 30, 2020
by
Lakshman Patel RJIT
1.6k
views
nielit2017july-scientistb-cs
discrete-mathematics
graph-theory
euler-graph
4
votes
1
answer
3
TIFR CSE 2020 | Part B | Question: 14
The figure below describes the network of streets in a city where Motabhai sells $\text{pakoras}$ from his cart. The number next to an edge is the time (in minutes) taken to traverse the corresponding street. At present, the cart is required to start at point $s$ ... $f$ are the only odd degree nodes in the figure above. $430$ $440$ $460$ $470$ $480$
Lakshman Patel RJIT
asked
in
Graph Theory
Feb 11, 2020
by
Lakshman Patel RJIT
704
views
tifr2020
graph-theory
euler-graph
1
vote
1
answer
4
TIFR CSE 2020 | Part B | Question: 13
Let $G$ be an undirected graph. An Eulerian cycle of $G$ is a cycle that traverses each edge of $G$ exactly once. A Hamiltonian cycle of $G$ is a cycle that traverses each vertex of $G$ exactly once. Which of the following ... has a Hamiltonian cycle A complete graph always has both an Eulerian cycle and a Hamiltonian cycle All of the other statements are true
Lakshman Patel RJIT
asked
in
Graph Theory
Feb 11, 2020
by
Lakshman Patel RJIT
516
views
tifr2020
graph-theory
euler-graph
0
votes
3
answers
5
Doubt [Graph Theory]
Is it possible that a disconnected graph be an Euler graph ?
jatin khachane 1
asked
in
Graph Theory
Dec 24, 2018
by
jatin khachane 1
1.3k
views
graph-theory
euler-graph
2
votes
2
answers
6
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?
dan31
asked
in
Graph Theory
Nov 6, 2018
by
dan31
1.5k
views
graph-theory
euler-graph
graph-connectivity
0
votes
1
answer
7
Test by Bikram | Mock GATE | Test 4 | Question: 19
An $Euler$ circuit of an undirected graph is a circuit in which each edge of the graph appears exactly once. Which of the following undirected graphs must have an $Euler$ circuit ? A complete graph with $12$ vertices A complete graph with $13$ vertices A tree with $13$ vertices I and II II only III only I and III
Bikram
asked
in
GATE
May 14, 2017
by
Bikram
171
views
tbb-mockgate-4
discrete-mathematics
graph-theory
graph-connectivity
euler-graph
3
votes
2
answers
8
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.
Jason GATE
asked
in
Graph Theory
Jan 31, 2017
by
Jason GATE
1.5k
views
graph-theory
euler-graph
euler-path
1
vote
1
answer
9
Test by Bikram | Mock GATE | Test 2 | Question: 52
An $Euler$ circuit of an undirected graph is a circuit in which each edge of the graph appears exactly once. Which of the following undirected graphs must have an $Euler$ circuit? A complete graph with $12$ vertices A complete graph with $13$ vertices A tree with $13$ vertices I and II III only II only I and III
Bikram
asked
in
Graph Theory
Jan 24, 2017
by
Bikram
210
views
tbb-mockgate-2
discrete-mathematics
graph-theory
euler-graph
6
votes
1
answer
10
TIFR CSE 2016 | Part B | Question: 9
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 ...
go_editor
asked
in
Graph Theory
Dec 29, 2016
by
go_editor
1.4k
views
tifr2016
discrete-mathematics
graph-theory
euler-graph
normal
2
votes
2
answers
11
graph theory
thor
asked
in
Graph Theory
Dec 28, 2016
by
thor
990
views
graph-theory
graph-connectivity
euler-graph
7
votes
2
answers
12
Graph connectivity
Consider the following statements $S1:2,3,3,3,3,3,4$ is a graphic sequence $S2:$ A connected graph with $10$ vertices and $16$ edges without having a cycle of length $3$, is a planar graph. Both $S1$ and $S2$ are true $S1$ is false but $S2$ is true $S2$ is false but $S1$ is true Both $S1$ and $S2$ are false
Rahul Jain25
asked
in
Graph Theory
Oct 10, 2016
by
Rahul Jain25
733
views
graph-theory
graph-connectivity
euler-graph
1
vote
1
answer
13
Graphs
Rahul Jain25
asked
in
Graph Theory
Oct 10, 2016
by
Rahul Jain25
218
views
graph-theory
cycle
euler-graph
3
votes
1
answer
14
UGC NET CSE | August 2016 | Part 2 | Question: 5
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.
makhdoom ghaya
asked
in
Graph Theory
Sep 24, 2016
by
makhdoom ghaya
3.1k
views
ugcnetcse-aug2016-paper2
graph-theory
euler-graph
1
vote
1
answer
15
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
makhdoom ghaya
asked
in
Graph Theory
Sep 5, 2016
by
makhdoom ghaya
6.0k
views
ugcnetcse-dec2010-paper2
graph-theory
euler-graph
10
votes
4
answers
16
ISRO2016-5
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
asu
asked
in
Graph Theory
Jul 4, 2016
by
asu
7.9k
views
graph-theory
euler-graph
isro2016
To see more, click for the
full list of questions
or
popular tags
.
Subscribe to GATE CSE 2023 Test Series
Subscribe to GO Classes for GATE CSE 2023
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
Life happens, just chill and do hardwork
ISRO RECRUITMENT FOR SCIENTIST B THROUGH GATE
POWER GRID CORPORATION OF INDIA LIMITED
INSTITUTE OF BANKING PERSONNEL SELECTION
GATE Overflow books for TIFR, ISRO, UGCNET and NIELIT
Subjects
All categories
General Aptitude
(2.4k)
Engineering Mathematics
(9.1k)
Digital Logic
(3.2k)
Programming and DS
(5.8k)
Algorithms
(4.5k)
Theory of Computation
(6.6k)
Compiler Design
(2.3k)
Operating System
(4.9k)
Databases
(4.5k)
CO and Architecture
(3.7k)
Computer Networks
(4.5k)
Non GATE
(1.3k)
Others
(2.4k)
Admissions
(648)
Exam Queries
(841)
Tier 1 Placement Questions
(17)
Job Queries
(74)
Projects
(9)
Unknown Category
(855)
Recent questions tagged euler-graph
Recent Blog Comments
Maximum age limit changed from 35 yrs. to 28...
Hmm, sir totally getting your point ☺️☺️....
yes, that's fine. But saying so in a public forum...
@gatecse Sir , I know you are correct. I just...
@Deepanshu I have to disagree there...