The complete graph Kn has ____ different spanning trees. – McqOptions

MCQOPTIONS

1.	The complete graph Kn has ____ different spanning trees.
A.	Nn – 2
B.	n x n
C.	nn
D.	n2
E.	None of these
Answer» B. n x n

Discussion

No Comment Found

Related MCQs

This page replacement algorithm gives the lowest possible page-fault rate for a fixed number of frames –
With reference to multiprogramming OS, pick the option which is not true.
The complete graph Kn has ____ different spanning trees.
Consider the following encryption algorithms? Data Encryption Standard (DES) Advanced Encryption Standard (AES) Rivest Shamir Adleman (RSA) Choose the option that correctly matches the given algorithms with the type of cryptography (public-key of private-key) utilised by them.
What are the two main types of indexes in SQL Indexing?
Data are followed to be transmitted in only one direction in a _________.
Belady’s anomaly states that _________
Which is a quality management technique that translates the needs of the customer into technical requirements for software?
Which of these measures are used to analyze the central tendency of data?
Communication between a computer and a keyboard involves __________ transmission.