Learn More
An isometric path is merely any shortest path between two vertices. If the vertices of the hypercube Qn are represented by the set of 0 –1 vectors of length n, an isometric path is obtained by changing the coordinates of a vector one at a time, never changing the same coordinate more than once. The minimum number of isometric paths required to cover the(More)
LIBRARIES-~ ~ ~ ~ ~ ~ ~ I Acknowledgements I would like to thank my advisor for suggesting and overseeing this work. My gratitude also goes out particularly to Max Lieblich and Damiano Testa for explaining things when I was confused, and to Christopher Malon for his invaluable technical advice., as well as to all my classmates generally. Finally, I would(More)
  • 1