Let G = (VE) be a graph. Define ξ(G) = Σd id x d where id is the number of vertices of degree d in G. If S and T are two different trees with ξ(S) = ξ(T)then

Explore topic-wise MCQs in Computer Science.

This section includes 51 Mcqs, each offering curated multiple-choice questions to sharpen your Computer Science knowledge and support exam preparation. Choose a topic below to get started.

51.	Let G = (V,E) be a graph. Define ξ(G) = Σd id x d, where id is the number of vertices of degree d in G. If S and T are two different trees with ξ(S) = ξ(T),then
A.	\|S\| = 2\|T\|
B.	\|S\| = \|T\|-1
C.	\|S\| = \|T\|
D.	\|S\| = \|T\|+1
Answer» D. \|S\| = \|T\|+1

Discussion

Explore topic-wise MCQs in Computer Science.

Let G = (V,E) be a graph. Define ξ(G) = Σd id x d, where id is the number of vertices of degree d in G. If S and T are two different trees with ξ(S) = ξ(T),then