Proper distance in edge-colored hypercubes

被引：3

作者：

Cheng, Eddie ^{[1
]}

Magnant, Colton ^{[2
]}

Medarametla, Dhruv ^{[3
]}

机构：

[1] Oakland Univ, Dept Math & Stat, Rochester, MI 48309 USA

[2] Georgia Southern Univ, Dept Math Sci, Statesboro, GA 30460 USA

[3] Stanford Univ, Stanford, CA 94305 USA

来源：

APPLIED MATHEMATICS AND COMPUTATION | 2017年 / 313卷

关键词：

Edge-coloring; Proper connection; Hypercube;

D O I：

10.1016/j.amc.2017.05.065

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

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. (C) 2017 Elsevier Inc. All rights reserved.

引用

页码：384 / 391

页数：8