let x be the adjacency matrix of a graph .G with no self loop.The entries along the principle diagonal of x are

Home / Engineering / Data Structure and Algorithms (DSA) / Question

M

Mr. Dubey • 51.43K Points
Coach

Q.) let x be the adjacency matrix of a graph .G with no self loop.The entries along the principle diagonal of x are

(A) all "0"

(B) all "1"

(C) both 0&1

(D) different

Correct answer : Option (A) - all "0"

Share

Discusssion

Login to discuss.

Related MCQs on Data Structure and Algorithms (DSA)

Q. #include <stdio.h> #include <string.h> int main(){ int i=0; for(;i<=2;) printf(" %d",++i); return 0; }

Q. Which of the following sorting methods would be most suitable for sorting a list which is almost sorted

Q. In case of the two-transistor model (T1 & T2) of GTO with anode-short, the anode-short is placed between the

Q. In a clipping algorithm of Cohen & Sutherland using region codes, a line is already clipped if the ?

Q. Stoke's Theorem relates, ______ integral to a _______ integral.

Q. If the sign bit of mantissa is 0 and the exponent is increased from a positive to a more negative number the result is

Q. As per Stoke's Theorem, = _________.

Q. In a parallel inverter

Q. Surge current rating of an SCR is

Q. During the commutation period in 3 phase converter, overlap time is