Proper distance in edge-colored hypercubes
| Autor: | Eddie Cheng, Dhruv Medarametla, Colton Magnant |
|---|---|
| Rok vydání: | 2017 |
| Předmět: |
Discrete mathematics
020203 distributed computing 0209 industrial biotechnology Induced path Applied Mathematics ComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISION 02 engineering and technology Graph Hypercube graph Combinatorics Computational Mathematics Edge coloring 020901 industrial engineering & automation Colored 0202 electrical engineering electronic engineering information engineering Hypercube Distance ComputingMethodologies_COMPUTERGRAPHICS MathematicsofComputing_DISCRETEMATHEMATICS Mathematics |
| Zdroj: | Applied Mathematics and Computation. 313:384-391 |
| ISSN: | 0096-3003 |
| DOI: | 10.1016/j.amc.2017.05.065 |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect