neexam
Let G1 = (V, E1) and G2 = (V, E2) be connected graphs on the same vertex set V with more than two vertices. If G1 n G2 = (V, E1 n E2) is
not a connected graph, then the graph G1 U G2 = (V, E1 U E2)
यदि G1 = (V, E1) और G2 = (V, E2) समान वर्टेक्स सेट V पर कनेक्टेड ग्राफ है. यदिG1 n G2 = (V, E1n E2) कनेक्टेड ग्राफ नही है, तब ग्राफ G1 UG2 = (V,
E1 U E2)
Select one:
O A has chromatic number strictly greater than those of G1 and G2
has chromatic number strictly greater than those of G1 and G2
OB. must have a cut-edge (bridge)
एक cut-edge (bridge)होना चाहिए
O C. cannot have a cut vertex
एक cut vertex नहीं हो सकता
D. must have a cycle
must have a cycle
Which of the following ways can be used to represent a graph?
निममम किन तरीकों से ग्राफ का प्रदर्शन किया जा सकता है?
Answers
Answered by
0
sorry. for this....
Similar questions