DM-Graphs-Q12

+1 vote

Which of the following integer sequence if used as degree sequence would represent the tree?

\text{I. }1,1,1,1,1,1,4,4

\text{II. }1,1,1,1,2,2,2,2

\text{III. }1,1,1,2,3,3,3

\text{A. Only I}

\text{B. Only II}

\text{C. Only I and III}

\text{D. Only II and III}

asked Jul 12 in Discrete Maths by gbeditor (23,760 points)
reshown Jul 13 by gbeditor

1 Answer

+1 vote
The no of edges and sum of degree seq must satisfy (

(n-1) and 2(n-1)

1. 7,14.

2. 7,12

3. 6,14

 

So ans is 1
answered Jul 13 by tssharma-anuragkrishna (380 points)
if empty tree then its does not satisfied.plz clearified
Answer:
...