Skip to content

Instantly share code, notes, and snippets.

@kedarmhaswade

kedarmhaswade/hgt-questions.md

Last active August 29, 2015 14:07
Show Gist options
  • Save kedarmhaswade/d117f42ba90b07053dc9 to your computer and use it in GitHub Desktop.
Save kedarmhaswade/d117f42ba90b07053dc9 to your computer and use it in GitHub Desktop.
Download ZIP
Handbook of Graph Theory 2nd Edition -- Questions
Raw
hgt-questions.md

Questions on the Brilliant Handbook of Graph Theory by Gross/Yellen/Ping

  1. In Algorithm 1.1.2 page 20, the while loop checks if T spans G. Shouldn't it check if T spans C_G(V) -- the component of the graph G, just like in Algorithm 1.1.1?
  2. E3: Page 23 -- For k = 0,1,2,3, there is exactly one k-regular simple graph with 4 vertices. (There are three 1-regular graphs with 4-vertices, though all of them are isomorphic -- does this need to be clarified?)
  3. Algorithm 2.1.2 Breadth-First Search (page 61) --
    1. change if mark[w] = visited then to if mark[w] != visited then
    2. change distance[w] := distance[v] + 1 (not distance[w] + 1)
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment