Weihua Yang

Proper distance and number of properly colored paths in edge-colored hypercubes and folded hypercubes

In edge-colored graphs, a path is said to be properly colored when consecutive edges have different colors. A graph is properly connected if for every pair of vertices there exists such a path between them. The length of a shortest properly colored path connecting two vertices de...