All Questions
Tagged with eulerian-path connectedness
3
questions
0
votes
1
answer
105
views
Question on graph Connectivity.
Question
Consider the statement below-:
$\text{1.In simple graph with 6 vertices,if degree of each vertex is 2 ,then graph is connected}$
$\text{2.In simple graph with 6 vertices,if degree of each ...
- 2,540
0
votes
1
answer
357
views
Eulerian Path In Directed Graph using SCC
I read in geeks for geeks that we need to find out two things to know whether a digraph has eulerian circuit or not, they are:
1. All vertices must belong to a single SCC.
2. In and out degrees of ...
- 113
1
vote
0
answers
104
views
Properties of Connected Closed Trails?
Consider the (sub)graph below. I am allowing for the possibility of additional edges and nodes, and just want to look at the features of this subgraph.
What seems apparent is that there is not a ...
- 1,226