Computer Science, asked by testdummyhere1212, 1 month ago

A K- connected graph can be disconnected only it atleast K-____________ is removed.
A) Vertices

B) Edges

C) Connectivity

D) Cut

Answers

Answered by Anonymous

1

Answer:

edges is right answer.

hope this helps you mate ❇️✌️❇️

follow my top following ❣️

Previous Question

Next Question

Similar questions

Math, 27 days ago

Adjoining figure two arcs PAQ and PBQ is a part of a circle with center O and radius OP while arcs PBQ is a semicircle drawn on PQ as diameter, If $\sf OP=PQ=10 cm$ . Show that the area of the shaded region is $\sf25 \bigg( \sqrt{3 } - \dfrac{ \pi}{6} \bigg) {cm}^{2}$ Class - 10th SPAM WON'T BE TOLERATED ⚠️⚠️⚠️⚠️ NO PLAGIARISM FROM ANY PLATFORM ⚠️⚠️⚠️⚠️ JUNIORS STAY...

Math, 27 days ago

iii) 31/3 + 69 / 8 - 199 / 16...

Biology, 27 days ago

what is no. 2 in the diagram?

World Languages, 1 month ago

vidhiling lakar kya hota hai...

Math, 1 month ago

Simran and kriti spent 3 weeks to complete a science project. How much time did they spend in making the project?write your answer in days.

English, 8 months ago

Superlative form of the word "bad".

Math, 8 months ago

rationalize the denominator ...

Math, 8 months ago

what is your favorite food aanswere me i will really follow u...