• edited by
34 views
0 0 votes

Maximum number of edges in a simple graph with ' $n$ ' vertices and ' $k$ ' components is:

  1. $\dfrac{(n-2)(n-1)}{2}+1$
  2. $\dfrac{(n-k)(n-k+1)}{2}$
  3. $n^{2}$
  4. $\dfrac{(n)(n-1)}{2}$

Please log in or register to answer this question.

Answer:
Position:
Show:

Related questions

0 0 votes
0 0 answers
53
53 views
Shubham Sharma 2 asked Jun 28
53 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
43
43 views
Shubham Sharma 2 asked Jun 28
43 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
36
36 views
Shubham Sharma 2 asked Jun 28
36 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
39
39 views
Shubham Sharma 2 asked Jun 28
39 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...