Proper Coloring Distance in Edge-Colored Cartesian Products of Complete Graphs and Cycles
Abstract
An path that is edge-colored is called proper if no two consecutive edges receive the same color. A general graph that is edge-colored is called properly connected if, for every pair of vertices in the graph, there exists a properly colored path from one to the other. Given two vertices u and v in a properly connected graph G, the proper distance is the length of the shortest properly colored path from u to v. By considering a specific class of colorings that are properly connected for Cartesian products of complete and cyclic graphs, we present results on the proper distance between all pairs of vertices in the graph.
References
- 1. , On proper-path colorings in graphs, J. Combin. Math. Combin. Comput. 97 (2016) 189–207. Google Scholar
- 2. , Proper connection of graphs, Discrete Math. 312(17) (2012) 2550–2560. Crossref, ISI, Google Scholar
- 3. , Proper distance in edge-colored hypercubes, Appl. Math. Comput. 313 (2017) 384–391. Crossref, ISI, Google Scholar
- 4. , Properly colored notions of connectivity — A dynamic survey, Theo. Appl. Graphs 0(1) (2015) Art. 2. Google Scholar
- 5. , Properly Colored Connectivity of Graphs,
SpringerBriefs in Mathematics (Springer, Cham, 2018). Crossref, Google Scholar - 6. , Number of proper paths in edge-colored hypercubes, Applied Mathematics and Computation 332 (2018) 420–424. Crossref, ISI, Google Scholar


