• edited by
35 views
0 0 votes

Total number of spanning tree of a complete graph of $4$ vertices $\mathrm{K}_{4}$ is:

  1. $15$
  2. $16$
  3. $3$
  4. $17$

Please log in or register to answer this question.

Answer:
Position:
Show:

Related questions

0 0 votes
0 0 answers
45
45 views
Shubham Sharma 2 asked Jun 28
45 views
Which of the following statements is TRUE?The cardinality ratio for a binary relationship specifies the maximum number of relationship instances that an entity can partic...
0 0 votes
0 0 answers
34
34 views
Shubham Sharma 2 asked Jun 28
34 views
Which of the following represents the function of a Multiplexer?$\mathrm{Y}=\mathrm{A}+\mathrm{B}$$\mathrm{Y}=\mathrm{A} \mid \mathrm{B}$$\mathrm{Y}=\mathrm{A} ~\& ~\text...
0 0 votes
0 0 answers
31
31 views
Shubham Sharma 2 asked Jun 28
31 views
The prefix equivalent of the following infix expression is:$a / b-c+d^{*} e-a ^{*}c$$-+-/ a b a^{*} d e^{*} a c$$+ / a b c^{*} d e^{*} a c$$-+/ a b c-^{*} d e^{*} a c$$ +...
0 0 votes
0 0 answers
34
34 views
Shubham Sharma 2 asked Jun 28
34 views
Which of the following file-type arguments is used in fopen $()$ library function to open a new file for both reading and writing, and destroys the file if a file with th...