How do I find the number of connected components in an undirected graph?

Click For Summary
To find the number of connected components in an undirected graph G=(V,E), it is essential to understand the definition of connected components. The original poster is struggling with the concept and has not provided specific details about the graph's structure, which is crucial for determining the number of components. A connected component is defined as a subset of the graph where any two vertices are connected to each other by paths, and which is connected to no additional vertices in the supergraph. For effective assistance, it is recommended to review foundational concepts in graph theory, such as those found in the linked Wikipedia article. Understanding these basics will aid in solving the task at hand.
plamen562
Messages
1
Reaction score
0
Need help ! – Graph Theory

Hello,
I have recently started studying “Graph Theory” but i find it very difficult. I'm still not good in this course. So I hope you can help me with the following task:

G=(V,E) is undirected (no oriented) graph. We need to find the number of all components which are connectet to G.

Can you help me solve and understanding this task?
Thanks
 
Physics news on Phys.org


I am afraid you didn't pose your question precisely.
You said you are just given an undirected graph G=(V,E), and nothing more.

You have not specified anything about the structure of (V,E), so I really don't see how you could find a specific number of connected components in G.

I think you should first understand the definition of connected component in a graph: take a look http://en.wikipedia.org/wiki/Connected_component_%28graph_theory%29" .
 
Last edited by a moderator:

Thread 'Hypothesis testing: Defining H0, HA hypotheses so that ( H_A)_A' makes sense'

The standard _A " operator" maps a Null Hypothesis Ho into a decision set { Do not reject:=1 and reject :=0}. In this sense ( HA)_A , makes no sense. Since H0, HA aren't exhaustive, can we find an alternative operator, _A' , so that ( H_A)_A' makes sense? Isn't Pearson Neyman related to this? Hope I'm making sense. Edit: I was motivated by a superficial similarity of the idea with double transposition of matrices M, with ## (M^{T})^{T}=M##, and just wanted to see if it made sense to talk...
View full post »

Similar threads

Undergrad Number of edges in a tree digraph
  • · Replies 5 ·
Replies
5
Views
2K
MHB How many new branches will the complement graph of a deleted edge have?
  • · Replies 11 ·
Replies
11
Views
2K
Graduate Concrete examples of randomness in math vs. probability theory
  • · Replies 11 ·
Replies
11
Views
3K
Graph Theory: Does a Graph Have Cardinality?
  • · Replies 2 ·
Replies
2
Views
2K
MHB How many edges does the graph have?
  • · Replies 4 ·
Replies
4
Views
2K
MHB Is HSC NP-Complete in Graph Theory?
  • · Replies 1 ·
Replies
1
Views
2K
Undergrad Circuits or edge-disjoint unions of circuits in a connected graph
  • · Replies 1 ·
Replies
1
Views
3K
MHB Finding a Minimal Vertex Cover & Max Sets for a Graph
  • · Replies 2 ·
Replies
2
Views
2K
MHB Find total number of republications
  • · Replies 22 ·
Replies
22
Views
2K
Python Help solving a geometrical matching issue with Graph Neural Networks
  • · Replies 1 ·
Replies
1
Views
2K