3,786 views
0 votes
0 votes

1 Answer

0 votes
0 votes

If the simple graph G has 5 vertices and 7 edges, how many edges does G` have ? - If this was your question

with 5 vertices a complete graph can have 5c2 edges => 10 edges 

We know that edges(G) + edges(G`)=10 so edges(G`)=10-7=3

Had it been
If the simple graph G` has 5 vertices and 7 edges, how many edges does G have ?
Then G would've had 3 edges

Related questions

0 votes
0 votes
1 answer
1
1 votes
1 votes
2 answers
2
shivani2010 asked Jun 12, 2016
4,448 views
An undirected graph G has n vertices and n-1 edges then G isA. CyclicB. Addition of edge will make it cyclicC. EulerianD. Is a Tree
0 votes
0 votes
2 answers
3
yuuchan asked Jul 22, 2023
531 views
If G is a complete bipartite graph with n vertices (n >= 2) and minimum number of edges, then matching number of G is ____1n-1⌊n/2⌋⌈n/2⌉