Discrete Mathematics MCQs | Page - 39

Q. 381) Let R = {(3, 3), (6, 6), (9, 9), (12,12), (3,6), (6,3), (3, 9), (9, 3), (9, 12),(12,9)} be a relation on the set A = {3, 6, 9, 12}. The relation is _________

Q. 382) Let R={(1,b),(3,d),(2,b)} and S={(b,4),(2,5),(d,a)} be a relation then R composition S=____.

Q. 383) An undirected graph is tripartite if and only if it has no circuits of _______ lengths

Q. 384) A graph is bipartite if and only if its chromatic number is ________.

Q. 385) G is strongly connected implies _________.

Q. 386) The number of pendant vertices in a full binary tree with n vertices is ________.

Q. 387) The number of vertices in a full binary tree is _______.

Q. 388) A binary tree with 2k vertices of level k has at least _______ vertices.

Q. 389) For a symmetric digraph, the adjacency matrix is _________.

Q. 390) The diagonal entries of A A^T where A is the adjacency matrix are the _______.