True false question 8 incorrect mark 000 out of 100

This preview shows page 32 - 39 out of 39 pages.

TrueFalse
Question8IncorrectMark 0.00 out of 1.00Flag questionQuestion textHow many spanning trees are possible in the given figure?Answer:Question9CorrectMark 1.00 out of 1.00Flag questionQuestion textThe minimum number of colors required in a proper vertex coloring of the graph.2
Question10CorrectMark 1.00 out of 1.00
Flag questionQuestion textIndicate which, if any, of the following three graphs G = (V, E, φ), |V | = 5, is notisomorphic to any of the other two.Select one:
FeedbackYour answer is correct.Question11IncorrectMark 0.00 out of 1.00Flag questionQuestion textThe given graph is planar.Select one:
Question12CorrectMark 1.00 out of 1.00Flag questionQuestion textIndicate which, if any, of the following graphs G = (V, E, φ), |V | = 5, is notconnected.Select one:a. φ = ( a {1,2} b {2,3} c {1,2} d {2,3} e {3,4} f {1,5} )b. φ = ( 1 {1,2} 2 {1,2} 3 {2,3} 4 {3,4} 5 {1,5} 6 {1,5} )c. φ = ( a {1,2} b {2,3} c {1,2} d {1,3} e {2,3} f {4,5} )
FeedbackYour answer is correct.Question13IncorrectMark 0.00 out of 1.00Flag questionQuestion textThe number of simple digraphs with |V | = 3 isAnswerThese are lines or curves that connect vertices.76
Question2IncorrectMark 0.00 out of 1.00
Flag questionQuestion textA path which visits every vertex exactly onceAnswer:
Question3CorrectMark 1.00 out of 1.00Flag questionQuestion textEuler paths must touch all edges.Select one:
Question4CorrectMark 1.00 out of 1.00Flag questionQuestion textDoes this graph have an Euler Path, Euler Circuit, both, or neither?
Select one:a. Noneb. Euler Pathc. Bothd. Euler CircuitFeedbackYour answer is correct.Question5CorrectMark 1.00 out of 1.00Flag questionQuestion textA sequence of vertices such that every vertex in the sequence is adjacent to thevertices before and after it in the sequenceQuestion
Mark 0.00 out of 1.00Flag questionQuestion textWhich of the following is false?Select one:
FeedbackYour answer is incorrect.Question7CorrectMark 1.00 out of 1.00Flag questionQuestion textTracing all edges on a figure without picking up your pencil or repeating andstarting and stopping at different spotsSelect one:a. Euler Pathb. Euler CircuitFeedback
Your answer is correct.Question8CorrectMark 1.00 out of 1.00Flag questionQuestion textCircuits start and stop at _______________Select one:
FeedbackYour answer is correct.Question9IncorrectMark 0.00 out of 1.00Flag questionQuestion textAll graphs have Euler's PathSelect one:
Question10CorrectMark 1.00 out of 1.00
Flag questionQuestion textPaths start and stop at the same vertex.Select one:
End of preview. Want to read all 39 pages?

Upload your study docs or become a

Course Hero member to access this document

Term
Fall
Professor
ej
Tags
Graph Theory, Planar graph

  • Left Quote Icon

    Student Picture

  • Left Quote Icon

    Student Picture

  • Left Quote Icon

    Student Picture