Abstract
Let G and H be two graphs. The maximum integer k, for which there exists an edge coloring ϕ:E(G)→{1,2,…,k} that makes every copy of H has at least two edges with the same color, is the anti-Ramsey number of G with respect to H. Mycielski developed an interesting graph transformation that transforms G into the Mycielskian μ(G) of G. In this paper, we determine the anti-Ramsey number of μ(Cn) with respect to cycles of length 4, 2n and 2n+1, respectively.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callSimilar Papers
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
