World Scientific
  • Search
Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×
Our website is made possible by displaying certain online content using javascript.
In order to view the full content, please disable your ad blocker or whitelist our website www.worldscientific.com.

System Upgrade on Tue, Oct 25th, 2022 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at [email protected] for any enquiries.

Proper Coloring Distance in Edge-Colored Cartesian Products of Complete Graphs and Cycles

    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. E. Andrews et al., On proper-path colorings in graphs, J. Combin. Math. Combin. Comput. 97 (2016) 189–207. Google Scholar
    • 2. V. Borozan et al., Proper connection of graphs, Discrete Math. 312(17) (2012) 2550–2560. Crossref, ISIGoogle Scholar
    • 3. E. Cheng, C. Magnant and D. Medarametla, Proper distance in edge-colored hypercubes, Appl. Math. Comput. 313 (2017) 384–391. Crossref, ISIGoogle Scholar
    • 4. X. Li, C. Magnant and Z. Qin, Properly colored notions of connectivity — A dynamic survey, Theo. Appl. Graphs 0(1) (2015) Art. 2. Google Scholar
    • 5. X. Li, C. Magnant and Z. Qin, Properly Colored Connectivity of Graphs, SpringerBriefs in Mathematics (Springer, Cham, 2018). CrossrefGoogle Scholar
    • 6. L. Xue, W. Yang and S. Zhang, Number of proper paths in edge-colored hypercubes, Applied Mathematics and Computation 332 (2018) 420–424. Crossref, ISIGoogle Scholar