Travelling salesman problem

[Artur]

I was think about travelling salseman problem (Problem NP completeness). 
If problem is poor defined let on the start in symmetric trangular 
graphs with constant distance between neighborough vertices
these graphs have n2 vertices. Sealsman have to reached each vertice 
(but not necessary go through each edge and some edge two times available)

For 4  vertices  (S=Start F=Finsih)

  F
x     x
  S

For 9 vertices
      F
   x    x
x     x      x
 x      x
     S
etc