Scribd
Upload
307 views3 pages

W7 Assignment

The document defines a graph G representing the provinces of Nepal connected by shared borders. It then asks questions about properties of the graph like vertex degrees, planarity, coloring, and finding shortest paths. The key information is that G is a planar graph with 7 vertices and 10 edges representing the provinces of Nepal. It can be colored with 3 colors and the shortest path through all provinces starting at 3 and visiting 4 first has 7 edges.

Uploaded by

Morassa Chona
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
307 views3 pages

W7 Assignment

The document defines a graph G representing the provinces of Nepal connected by shared borders. It then asks questions about properties of the graph like vertex degrees, planarity, coloring, and finding shortest paths. The key information is that G is a planar graph with 7 vertices and 10 edges representing the provinces of Nepal. It can be colored with 3 colors and the shortest path through all provinces starting at 3 and visiting 4 first has 7 edges.

Uploaded by

Morassa Chona
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

W7 Assignment

1. Formalize the map of Nepal as a graph , where the vertices are the provinces and edges
connect vertices that represent different provinces with a common border. For example, {1, 3} is in E
because Provinces 1 and 3 share a border.

G = ({1, 2, 3, 4, 5, 6, 7}, {{1, 3}, {1,2},{2,3},{3,5},{3,4},{4,5},{4,6},{5,6},{5,7},{6,7}})


V = {1, 2, 3, 4, 5, 6, 7}
E = {{1, 3}, {1,2},{2,3},{3,5},{3,4},{4,5},{4,6},{5,6},{5,7},{6,7}}

2. What degree does each vertex of G have?

Vertex Degree
1 2
2 2
3 4
4 3
5 4
6 3
7 2

3. Determine which province is adjacent to the most other provinces.

- Province number 5.
4. Is G planar? If yes, provide a drawing as a justification, that is, draw G so that edges meet only at
vertices. If the graph is planar, how many faces does it have?

- Yes it is a planar Graph.

- The Graph has 5 faces.

5. Does G have an Euler circuit? Explain why or why not

- G has no Euler circuit because not all its vertices have even degrees.

6. Does G have a Hamilton path? Why or why not?

- G has no Hamilton path because you cannot visit each province exactly once.

7. How many different colors do you need to color each Province so that no same color will be adjacent?
List the provinces and colors (alternatively you could also draw them, but this is not required).

Province Colour
1 Blue
2 Yellow
3 Green
4 Blue
5 Yellow
6 Green
7 Blue

- 3 colours.
8. Find a subgraph G1 of G that takes you on the shortest path through all provinces of Nepal, starting in
Province 3 and Province 4 as the first stop. Write your subgraph as . For the purpose
of clarity, we assume that “shortest path” means “a path in G with the fewest number of edges ”.

G1 = ({1, 2, 3, 4, 5, 6, 7}, {{1,2},{2,3},{3,5},{3,4},{4,6},{5,7},{6,7}})

V = {1, 2, 3, 4, 5, 6, 7}
E1 = {{1,2},{2,3},{3,5},{3,4},{4,6},{5,7},{6,7}}

9. Mt. Everest is located in the north east corner of Province 1. Of course, you are superbly curious and
want to go see the mountain as quickly as possible. If you were to go to Province 1 first, would that
make your trip more complicated? Why or why not? Explain using formal notation, that is, formalize
this new trip as a subgraph of the graph G and compare it to

G2 = ({1, 2, 3, 4, 5, 6, 7}, {{1,2},{2,3},{1,3},{3,5},{4,6},{5,7},{6,7}})


V = {1, 2, 3, 4, 5, 6, 7}
E2 = {{1,2},{2,3},{1,3},{3,5},{4,6},{5,7},{6,7}}

You might also like