CPTS 553: Graph Theory Assignment 5 solved

$35.00

Category: You will receive a download link of the .ZIP file upon Payment

Description

5/5 - (1 vote)

1. The dodecahedron graph ๐บ is depicted below:
A. Determine, with justification, whether ๐บ is Eulerian.
B. Show that ๐บ is Hamiltonian by finding a Hamilton cycle.
2. Let ๐ป be the graph depicted to the right:
A. Find a 4-coloring of ๐ป.
B. Show that no 3-coloring of ๐ป exists.
3. The graph ๐‘ƒ3 ร— ๐‘ƒ3
is depicted below. Show that this graph is not
Hamiltonian. One approach: Show that any Hamilton path must
begin and end at even-numbered vertices. Why does this prevent
forming a Hamilton cycle?
4. Find the chromatic polynomial ๐‘๐บ
(๐‘˜)of ๐บ = ๐ถ6 and determine whether
๐‘˜ โˆ’ 2 is a factor of ๐‘๐บ
(๐‘˜).