- Related Questions & Answers
- Strongly Connected Graphs
- What are connected and disconnected Row Sets in JDBC?
- C++ Program to Find Strongly Connected Components in Graphs
- Bipartite Graphs
- Eulerian Graphs
- Planar Graphs
- Hamiltonian Graphs
- BFS for Disconnected Graph in C++
- Representation of Graphs
- Basic Concepts of Graphs
- Matrix Representation of Graphs
- Planar Graphs and their Properties
- Graphs and its traversal algorithms
- Isomorphism and Homeomorphism of graphs
- Tree or Connected acyclic graph

- Selected Reading
- UPSC IAS Exams Notes
- Developer's Best Practices
- Questions and Answers
- Effective Resume Writing
- HR Interview Questions
- Computer Glossary
- Who is Who

A graph is connected if any two vertices of the graph are connected by a path.

Vertex 1 | Vertex 2 | PATH |
---|---|---|

a | b | a b |

a | c | a b c, a c |

a | d | a b c d, a c d |

b | c | b a c , b c |

c | d | c d |

A graph is disconnected if at least two vertices of the graph are not connected by a path. If a graph G is disconnected, then every maximal connected subgraph of G is called a connected component of the graph G.

Vertex 1 | Vertex 2 | PATH |
---|---|---|

a | b | a b |

a | c | Not Available |

a | d | Not Available |

b | c | Not Available |

c | d | c d |

Advertisements