Grady Bullington

Learn More
The Traveling Salesman Problem (TSP) is still one of the most researched topics in computational mathematics, and we introduce a variant of it, namely the study of the closed k-walks in graphs. We search for a shortest closed route visiting k cities in a non complete graph without weights. This motivates the following definition. Given a set of k distinct(More)
25 The Traveling Salesman Problem (TSP) is still one of the most researched topics in computational mathematics, and we introduce a variant of it, namely the study of the closed k-walks in graphs. We 2 G. Bullington, R. Gera, L. Eroh And S.J. Winters search for a shortest closed route visiting k cities in a non complete graph without weights. This motivates(More)
The Connell sum sequence refers to the partial sums of the Connell sequence. In this paper, the Connell sequence, Connell sum sequence and generalizations from Iannucci and Mills-Taylor are interpreted as sums of elements of triangles, relating them to polygonal number-stuttered arithmetic progressions. The n-th element of the Connell sum sequence is(More)
  • 1