Classroom 12:34 AM Wed Dec 15 . . 83% e docs.google.com What is the order of the graph? * P F E D O N OO O Which of the following is NOT a walk from A to D? * B F E O AEFEBFD O ABCD O AFEBCD AEFCD Which of the following is a loop? *Classroom 12:34 AM Wed Dec 15 . . 83% a docs.google.com The number of vertices in K30 is * O 30 O 20 O 276 O 300 If a complete graph has degree 3 for each vertex, then how many diagonals are in the graph? * O 2 O 3 O 4 O 5 Touching all vertices in a graph without repeating or picking up your pencil and starting and stopping at different spot. * O Euler Trail O Euler Tour O Hamilton Cycle Hamilton Path Touching all vertices in a graph without repeating or picking up your pencil and starting and stopping at same spot. * Euler Trail O Euler Tour O Hamilton Cycle O Hamilton Path4 Classroom 12:34 AM Wed Dec '15 1? 83% - i docs.google.c0m Which is the correct statement of a degree of a vertex? * What is the order of the graph? * Classroom 12:35 AM Wed Dec 15 @ 83% a docs.google.com Touching all edges in a graph without repeating or picking up your pencil and starting and stopping at same spot. * Euler Trail Euler Tour O Hamilton Cycle O Hamilton Path Touching all edges in a graph without repeating or picking up your pencil and starting and stopping at different spot. * O Euler Trail O Euler Tour O Hamilton Cycle O Hamilton Path Which of the following graph is Eulerian? * G1 G2 d G3 G4 O G1 G1, G24 Classroom 12:34 AM Wed Dec '15 1? 83% - i docs.google.c0m Which of the following is NOT a circuit in the graph? * 0 None of the Above Which of the following is NOT a path in the graph? * O FEBAEFD O FBCCD O FEABFD 0 All of the Above Which is the correct statement of a degree of a vertex? * Classroom 12:34 AM Wed Dec 15 83% 12.slu.edu.ph X QUIZ 4: MODULES 7 & 8 X + a docs.google.com 2 . . . Which of the following is a loop? * B F E D O BF O CC O BC O C Which one of the following statements is NOT true about this graph? * B F E O There is a circuit starting and ending at E. O There are multiple edges. O It is a connected graph. O A loop exists. O None of the above