Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged euler-graph
0
votes
0
answers
1
Discrete Mathematics
Çșȇ ʛấẗẻ
52
views
Çșȇ ʛấẗẻ
asked
Aug 28, 2023
Mathematical Logic
euler-graph
+
–
0
votes
1
answer
2
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.
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...
admin
2.1k
views
admin
asked
Mar 30, 2020
Graph Theory
nielit2017july-scientistb-it
discrete-mathematics
graph-theory
euler-graph
+
–
0
votes
3
answers
3
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.
The following graph has no Euler circuit becauseIt has $7$ vertices.It is even-valent (all vertices have even valence).It is not connected.It does not have a Euler circui...
admin
2.3k
views
admin
asked
Mar 30, 2020
Graph Theory
nielit2017july-scientistb-cs
discrete-mathematics
graph-theory
euler-graph
+
–
6
votes
1
answer
4
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$
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...
admin
992
views
admin
asked
Feb 10, 2020
Graph Theory
tifr2020
graph-theory
euler-graph
+
–
3
votes
1
answer
5
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
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 ea...
admin
774
views
admin
asked
Feb 10, 2020
Graph Theory
tifr2020
graph-theory
euler-graph
+
–
0
votes
3
answers
6
Doubt [Graph Theory]
Is it possible that a disconnected graph be an Euler graph ?
Is it possible that a disconnected graph be an Euler graph ?
jatin khachane 1
1.9k
views
jatin khachane 1
asked
Dec 24, 2018
Graph Theory
graph-theory
euler-graph
+
–
0
votes
1
answer
7
Self doubt
Is this graph Euler?
Is this graph Euler?
Shadan Karim
388
views
Shadan Karim
asked
Dec 21, 2018
Graph Theory
graph-theory
euler-graph
+
–
2
votes
2
answers
8
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?
Consider the given statementsS1: 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 e...
dan31
2.2k
views
dan31
asked
Nov 6, 2018
Graph Theory
graph-theory
euler-graph
graph-connectivity
+
–
0
votes
1
answer
9
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
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$...
Bikram
431
views
Bikram
asked
May 14, 2017
GATE
tbb-mockgate-4
discrete-mathematics
graph-theory
graph-connectivity
euler-graph
+
–
4
votes
2
answers
10
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.
Which of the following Graph has Euler Path but is not an Euler Graph?A. K1,1 B.K2,10 C.K2,11D.K10,11.
Jason GATE
1.9k
views
Jason GATE
asked
Jan 31, 2017
Graph Theory
graph-theory
euler-graph
euler-path
+
–
2
votes
1
answer
11
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
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$...
Bikram
357
views
Bikram
asked
Jan 24, 2017
Graph Theory
tbb-mockgate-2
discrete-mathematics
graph-theory
euler-graph
+
–
7
votes
1
answer
12
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 and returns to the vertex after traveling on each edge exactly once.) $K_{9, 9}$ $K_{8, 8}$ $K_{12, 12}$ $K_9$ The ...
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 an...
go_editor
2.2k
views
go_editor
asked
Dec 29, 2016
Graph Theory
tifr2016
discrete-mathematics
graph-theory
euler-graph
normal
+
–
2
votes
2
answers
13
graph theory
thor
1.3k
views
thor
asked
Dec 28, 2016
Graph Theory
graph-theory
graph-connectivity
euler-graph
+
–
7
votes
2
answers
14
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
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$, i...
Rahul Jain25
1.0k
views
Rahul Jain25
asked
Oct 10, 2016
Graph Theory
graph-theory
graph-connectivity
euler-graph
+
–
1
votes
1
answer
15
Graphs
Rahul Jain25
362
views
Rahul Jain25
asked
Oct 10, 2016
Graph Theory
graph-theory
cycle
euler-graph
+
–
4
votes
1
answer
16
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.
Given the following graphs : $(G_{1})$ $(G_{2})$Which of the following is correct ?$G_{1}$ contains Euler circuit and $(G_...
makhdoom ghaya
3.6k
views
makhdoom ghaya
asked
Sep 23, 2016
Graph Theory
ugcnetcse-aug2016-paper2
graph-theory
euler-graph
+
–
2
votes
1
answer
17
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
makhdoom ghaya
7.5k
views
makhdoom ghaya
asked
Sep 5, 2016
Graph Theory
ugcnetcse-dec2010-paper2
graph-theory
euler-graph
+
–
11
votes
4
answers
18
ISRO2016-5
A given connected graph $\text{G}$ is a Euler Graph if and only if all vertices of $\text{G}$ are of same degree even degree odd degree different degree
A given connected graph $\text{G}$ is a Euler Graph if and only if all vertices of $\text{G}$ are ofsame degree even degreeodd degree ...
asu
9.0k
views
asu
asked
Jul 4, 2016
Graph Theory
graph-theory
euler-graph
isro2016
+
–
11
votes
2
answers
19
ISRO2007-06
A graph with $n$ vertices and $n-1$ edges that is not a tree, is Connected Disconnected Euler A circuit
A graph with $n$ vertices and $n-1$ edges that is not a tree, isConnectedDisconnectedEulerA circuit
go_editor
2.8k
views
go_editor
asked
Jun 10, 2016
Graph Theory
isro2007
graph-theory
euler-graph
+
–
To see more, click for the
full list of questions
or
popular tags
.
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register