For which of the following combinations of the degrees of vertices would the connected graph be eulerian?
Anonymous Quiz
31%
1,2,3
14%
2,3,4
14%
2,4,5
41%
1,3,5
A graph with all vertices having equal degree is known as a __________
Anonymous Quiz
21%
Multi Graph
18%
Regular Graph
21%
Simple Graph
41%
Complete Graph
Which of the following ways can be used to represent a graph?
Anonymous Quiz
50%
Adjacency List and Adjacency Matrix
15%
Incidence Matrix
24%
Adjacency List, Adjacency Matrix as well as Incidence Matrix
12%
No way to represent