edited by
317 views
0 votes
0 votes

Two adjacent edges in a simple graph are said to be in series if their common vertex is of degree ____.

  1. 1
  2. 2
  3. 3
  4. 4
edited by

1 Answer

Answer:

Related questions

2 votes
2 votes
1 answer
1
Bikram asked Nov 26, 2016
687 views
Which one of the following is the tightest upper bound that represents the time complexity of inserting an element into a binary search tree of n nodes?O(1)O(n log n)O(n)...
0 votes
0 votes
1 answer
3
Bikram asked Nov 26, 2016
1,637 views
Three algorithms do the same task. Algorithm One is $O(N)$ and Algorithm Two is $O(\log N)$ and Algorithm Three is $O(N1/2)$. Which algorithm should execute the fastest f...
1 votes
1 votes
3 answers
4