Multiple Choice
If G is a connected planar graph of v vertices e edges and r regions then
A) v-e+r=2
B) e-v+r=2
C) v+e-r=2
D) None of above.
Correct Answer:
Verified
Correct Answer:
Verified
Related Questions
Q1: The following grammar<br>G = (N, T, P,
Q3: Any given transition graph has an equivalent:<br>A)regular<br>B)DFSM
Q4: Given an arbitrary non-deterministic finite automaton NFA
Q5: Which one of the following statement is
Q6: Grammars that can be translated to DFAs:<br>A)Left
Q7: Which of the following is true with
Q8: A language L is accepted by a
Q9: Type-1 Grammar is known as_<br>A)CFG<br>B)CSG<br>C)REGULAR<br>D)All
Q10: Let L<sub>1</sub> = {w ? {0,1}? |
Q11: Regular expressions are<br>A)Type 0 language<br>B)Type 1 language<br>C)Type