A community for students.

Here's the question you clicked on:

55 members online
  • 0 replying
  • 0 viewing


  • 5 years ago

Hey everybody. I want to know the difference, with examples, between a connected graph, a strongly connected graph and a biconnected graph in both directed and undirected graphs. Is a strongly connected graph a connected one?, is a biconnected graph a strongly connected graph?

  • This Question is Closed
  1. anonymous
    • 5 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    connected graphs are those in which atleast one pair of nodes are connected with edges.strongly connected graph is the one in which every nodes are connected or u can say that between every pair of nodes,there will exist atleast one path between.(path is interconnection of vertices and edges);then there is weakly connected graph in which atleast there is a node which is not connected or it is isolated

  2. Not the answer you are looking for?
    Search for more explanations.

    • Attachments:

Ask your own question

Sign Up
Find more explanations on OpenStudy
Privacy Policy

Your question is ready. Sign up for free to start getting answers.

spraguer (Moderator)
5 → View Detailed Profile

is replying to Can someone tell me what button the professor is hitting...


  • Teamwork 19 Teammate
  • Problem Solving 19 Hero
  • You have blocked this person.
  • ✔ You're a fan Checking fan status...

Thanks for being so helpful in mathematics. If you are getting quality help, make sure you spread the word about OpenStudy.

This is the testimonial you wrote.
You haven't written a testimonial for Owlfred.