Proper Distance in Edge-Colored Hypercubes

Authors

• Eddie Cheng, Oakland UniversityFollow
• Colton Magnant, Georgia Southern UniversityFollow
• Dhruv Medarametla, Stanford UniversityFollow

Document Type

Article

Publication Date

11-15-2017

Publication Title

Applied Mathematics and Computation

DOI

10.1016/j.amc.2017.05.065

ISSN

0096-3003

Abstract

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.

Recommended Citation

Cheng, Eddie, Colton Magnant, Dhruv Medarametla. 2017. "Proper Distance in Edge-Colored Hypercubes." Applied Mathematics and Computation, 313: 384-391. doi: 10.1016/j.amc.2017.05.065
https://digitalcommons.georgiasouthern.edu/math-sci-facpubs/593

Copyright

See the publisher's copyright and reuse policies.