Log In

Recent questions tagged euler-graph

2 votes
2 answers
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 dan31 433 views
3 votes
2 answers
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 Jason GATE 525 views
5 votes
1 answer
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$ ... set $ E(G) = \{ \{i, j\} : 1 \leq i < j \leq 5 \: or \: 5 \leq i < j \leq 9 \}.$
asked Dec 29, 2016 in Others jothee 366 views
2 votes
1 answer
6 votes
2 answers
1 vote
1 answer
asked Oct 10, 2016 in Graph Theory Rahul Jain25 123 views
2 votes
1 answer
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 Graph Theory makhdoom ghaya 1.1k views
1 vote
2 answers
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 makhdoom ghaya 1.1k views
9 votes
4 answers
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 asu 3.6k views
To see more, click for the full list of questions or popular tags.