Question

Suppose that we have a graph with vertices 1, 2, 3, 4, 5, 6, 7 and edges (1, 5), (2, 5), (3, 4), (3, 5), (6, 2), (7, 1), (7, 4). Draw this graph and execute the function mexset1) to find the number of vertices in the largest independent set of the graph. What is the best way to choose v' for executing this function? Must draw a tree structure to show how you come up with the answer.

Answer 1

that we have a graph with vertices 1,2,3,4,5,6,7 and edges (1,5), (2,5),(3,4),(3,5),(6,2),(7,1),(7,4). this graph and execute the function mexset 1() to find the number of vertices in the largest independent set of the graph.
Doppose that we have a graph with vertices 1, 2, 3, 4, 5, 6, 7 and edges (1,5), (2,5),(3,0),(3,5) (6,2); (2,1),(2,4). Doow this goraph and execute the function mexset 1() to find the number of Vertices in the largest independent set of the gooch. what as the best way to chose V. por executing this function ? Must draw a tice stru -cture to show how you come up with the answer. 18) Given that V = {1,2,3,4,5,6,73 what adgecent to is masset each other us no vertices will be and if any vertere soin

the group of Verted and break the rule of Independent set before that is maximum indepen -dent Set. d = {1,2,33 maximum Podespendent set S - {1,2,3,4,5,6A . - The best way to find out is first wirrte the lentices and select the first Vortex and all write it one Independent set the remove the adjacent ventede of that lentede do it such. a wry and you will get the maximum în more - dendent function and if you add one Venter it will break the property of -dency and if you read this fosforly you will get the all answer. Indepen I hope