Math, asked by lokeshmass39, 1 month ago

A graph G is said to be _________ if there exists a path between every pair of vertices.

a.
Simple Graph

b.
Connected Graph

c.
Regular Graph

d.
Subgraph

Answers

Answered by prajapatikuldeep2021

0

Answer:

Regular graph

Step-by-step explanation:

is correct answer

Previous Question

Next Question

Similar questions

Computer Science, 24 days ago

Which of the following statement is false? OPTIONS: (a) A Turing machine is more powerful than finite state machine because it has halt state. (b) A finite state machine can be assumed to be a Turing machine of finite tape length, with rewinding capability and unidirectional tape movement. (c) Both (a) and (b) (d) None of the above.

English, 24 days ago

1)The poor man said ,"will you help me"? 2)my father said to me ,"did you go to school"? 3)he said to you ,"the bus is coming now" 4)I said to here,"I am here to you" 5)she is said to you ,"2hours ago I ate an apple" 6)he said to me ,"I shall go to Lahore tommorow" give this answers...

Physics, 24 days ago

natural and synthetic fibres are used in the textile industry. what are the benefits natural fibers?

History, 1 month ago

what are the two main sources of information for the period of aurangzeb reign...

Math, 1 month ago

who was the first spammer to spam in comment section ...

English, 8 months ago

the imitation of electronic sounds by Birds is demonstrated by bird that live ...

Hindi, 8 months ago

16)भारतीयों की कहां दुर्दशा हो रही थी ?class 9 Hindi Oa) अफ्रीका में Ob) अमेरिका में Oc) जापान में Od) इनमें से कोई नहीं...

English, 8 months ago

why does world remember Einstein as a world citizen why des he campaign for after he got invovled in politics ...