Eulerian and Hamiltonian Graphs · Superchallenge problem

A hub office is directly linked to $6$ branch offices (a star graph). The company wants to add new links ONLY between branches so that a closed tour starting and ending at the hub can visit every branch exactly once. What is the minimum number of new branch-to-branch links needed?