MHB Finding a Minimal Vertex Cover & Max Sets for a Graph

  • Thread starter Thread starter mathmari
  • Start date Start date
  • Tags Tags
    Graph
AI Thread Summary
The discussion revolves around finding a minimal vertex cover for a given graph, with participants evaluating various sets as potential solutions. The initial proposal of the set C*={4,5,6} is dismissed as it does not cover all edges, specifically the edge (1,2). The algorithm presented for constructing a vertex cover leads to larger sets, with C={1,2,3,4,5,6} being identified as a vertex cover but not minimal due to the removable vertex 1. The conversation also touches on the possibility of C*={1,2,3,7}, which is similarly deemed not minimal. Participants seek further guidance on finding a maximal independent set and maximal clique.
mathmari
Gold Member
MHB
Messages
4,984
Reaction score
7
Hey! :o

We have the following graph:
View attachment 5841 I want to find a minimal vertex cover.
I thought that the set $C^\star=\{4,5,6\}$ is a minimal vertx cover. Is this correct? How could we prove it? (Wondering) Then I want to find a vertex cover using the following approximation algorithm
Code:
C <- 0 
while E ≠ 0 do 
    choose e = (u,v) ∈ E arbitrary 
    C <- C U {u,v} 
    G <- G - {u,v} 
return C

I have done the following:
Suppose we start with e=(1,4) then C={1,4} and the graph is the following:
View attachment 5842
Then when we choose e=(5,7) we have C={1,4,5,7} and the graph will look as follows:
View attachment 5843
Then we can choose e=(2,3) and then we have C={1,2,3,4,5,7} and the graph will be:
View attachment 5844
Have we finished now?
Is a minimal vertex cover the set $C=\{1,2,3,4,5,7\}$ ? (Wondering)

Suppose we start with e=(4,5) then C={4,5} and the graph is the following:
View attachment 5845
Then when we choose e=(3,6) we have C={3,4,5,6} and the graph will look as follows:
View attachment 5846
Then we choose e=(1,2) and then we have C={1,2,3,4,5,6} and the graph will be:
View attachment 5847
So, a minimal vertex cover is the set $C=\{1,2,3,4,5,6\}$, right? (Wondering)

Does this mean that no matter which edge we choose at each step the minimal vertex cover will contain $6$ vertices? (Wondering) After that I want to find a maximal independent set of vertices and a maximal clique. Could you give me some hints how we could find them? (Wondering)
 

Attachments

  • Vertex.png
    Vertex.png
    4.1 KB · Views: 98
  • Vertex.png
    Vertex.png
    2.6 KB · Views: 104
  • Vertex.png
    Vertex.png
    1.7 KB · Views: 100
  • Vertex.png
    Vertex.png
    505 bytes · Views: 97
  • Vertex.png
    Vertex.png
    3.1 KB · Views: 95
  • Vertex.png
    Vertex.png
    1.5 KB · Views: 108
  • Vertex.png
    Vertex.png
    477 bytes · Views: 96
Physics news on Phys.org
mathmari said:
I thought that the set $C^\star=\{4,5,6\}$ is a minimal vertx cover.
No, the edge (1, 2) is not incident to any vertex in {4, 5, 6}.

mathmari said:
So, a minimal vertex cover is the set $C=\{1,2,3,4,5,6\}$, right?
This is a vertex cover, but it is not minimal because vertex 1 can be removed.
 
Evgeny.Makarov said:
No, the edge (1, 2) is not incident to any vertex in {4, 5, 6}.

Oh yes... So, is it maybe $C^\star=\{1,2,3,7\}$ ? (Wondering)
Evgeny.Makarov said:
This is a vertex cover, but it is not minimal because vertex 1 can be removed.

At the step when we choose e=(1,2) do we not have to add both vertices, $1$ and $2$, to the set $C$ according to the algorithm? (Wondering)
 

Similar threads

Back
Top