Skip to main content
Proper Distance in Edge-Colored Hypercubes
Applied Mathematics and Computation
  • Eddie Cheng, Oakland University
  • Colton Magnant, Georgia Southern University
  • Dhruv Medarametla, Stanford University
Document Type
Publication Date

An edge-colored path is called properly colored if no two consecutive edges have the same color. An edge-colored graph is called properly connected if, between every pair of vertices, there is a properly colored path. Moreover, the proper distance between vertices u and v is the length of the shortest properly colored path from u to v. Given a particular class of properly connected colorings of the hypercube, we consider the proper distance between pairs of vertices in the hypercube.

Citation Information
Eddie Cheng, Colton Magnant and Dhruv Medarametla. "Proper Distance in Edge-Colored Hypercubes" Applied Mathematics and Computation Vol. 313 (2017) p. 384 - 391 ISSN: 0096-3003
Available at: