Dark Mode

Recent questions tagged euler-graph

0 votes

0 answers

1

Discrete Mathematics

Çșȇ ʛấẗẻ asked in Mathematical Logic Aug 28, 2023

by Çșȇ ʛấẗẻ

54 views

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.

admin asked in Graph Theory Mar 30, 2020

by admin

2.1k views

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.

admin asked in Graph Theory Mar 30, 2020

by admin

2.3k views

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$

admin asked in Graph Theory Feb 10, 2020

by admin

996 views

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

admin asked in Graph Theory Feb 10, 2020

by admin

779 views

0 votes

3 answers

6

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

2.0k views

0 votes

1 answer

7

Self doubt
Is this graph Euler?

Shadan Karim asked in Graph Theory Dec 21, 2018

by Shadan Karim

403 views

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?

dan31 asked in Graph Theory Nov 6, 2018

by dan31

2.3k views

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

Bikram asked in GATE May 14, 2017

by Bikram

438 views

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.

Jason GATE asked in Graph Theory Jan 31, 2017

1.9k views

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

Bikram asked in Graph Theory Jan 24, 2017

by Bikram

359 views

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 ...

go_editor asked in Graph Theory Dec 29, 2016

2.2k views

2 votes

2 answers

13

thor asked in Graph Theory Dec 28, 2016

by thor

1.3k views

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

Rahul Jain25 asked in Graph Theory Oct 10, 2016

by Rahul Jain25

1.0k views

1 vote

1 answer

15

Rahul Jain25 asked in Graph Theory Oct 10, 2016

by Rahul Jain25

366 views

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.

makhdoom ghaya asked in Graph Theory Sep 23, 2016

by makhdoom ghaya

3.6k views

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

makhdoom ghaya asked in Graph Theory Sep 5, 2016

by makhdoom ghaya

7.5k views

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

asu asked in Graph Theory Jul 4, 2016

by asu

9.0k views

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

go_editor asked in Graph Theory Jun 10, 2016

2.8k views

To see more, click for the full list of questions or popular tags.

Recent questions tagged euler-graph