In Questions fiLl in the Blanks $\text { If a regular graph } G \text { has } 10 \text { vertices and } 45 \text { edges, then each vertex of } G \text { has degree }$

Q31: refer to a cubic graph, i.e., a

Q36: either give an example or prove that

Q39: In questions fill in the blanks.1113:1156<br>-

Q41: <img src="https://d2lvgg3v3hfg70.cloudfront.net/TB5530/.jpg" alt=" " class="answers-bank-image d-block" rel="preload"

Q43: Determine whether the graph is strongly connected,

Q46: In questions fill in the blanks.1113:1156<br>-

Q47: The picture at the right shows the

Q48: In questions fill in the blanks.1113:1156<br>-

Q49: <img src="https://d2lvgg3v3hfg70.cloudfront.net/TB5530/.jpg" alt=" " class="answers-bank-image d-block" rel="preload"

Q109: either give an example or prove that