Register

Consider a graph of only 1 vertex and no edges. Is it connected or disconnected?

926 views
0 votes
0 votes
User Avatar

3 Answers

3 votes
3 votes
It is connected graph

Its an complete graph as well as planar
• edited by
User Avatar
1 votes
1 votes
All (1 in this case) vertices are rechable.So,it is connected.

Also we cannot find any two vertices between which there is no path,so it is not disconnected.
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

2 votes
2 votes
2 answers
1
angel rajput asked Feb 14, 2015
1,473 views
any relation between planar graphs and connected or disconnected graph
I just wanted to confirm that if I have a disconnected graph ,then I can call it planar .so for a graph to be planar do I need to check whether it is connected or disconnected.
I just wanted to confirm that if I have a disconnected graph ,then I can call it planar .so for a graph to be planar do I need to check whether it is connected or disconn...
User Avatar
0 votes
0 votes
0 answers
2
Malusi asked Jan 12
105 views
Consider a weighted undirected graph with positive edge weights and let (u, v) be an [2] edge in the graph. It is known that the shortest path from source vertex r to u has weight 53 and shortest path from r to v has weight 65. Which statement is always true?
Consider a weighted undirected graph with positive edge weights and let (u, v) be an edge in the graph. It is known that the shortest path from source vertex r to u hasw...
User Avatar
0 votes
0 votes
1 answer
4
R S BAGDA asked Apr 27, 2022
293 views
What is the number of faces in a connected plane graph having 23 vertices, 30 edges?
What is the number of faces in a connected plane graph having 23 vertices, 30 edges?
What is the number of faces in a connected plane graph having 23 vertices, 30 edges?
User Avatar
Link Copied!