Abstract
Let Pn denote the path with exactly n vertices and let Tn,i denote the tree obtained from Pn−1 by adding a pendant vertex to the (i+1)-th vertex of Pn−1, where n≥4 and 1≤i≤n−3. In this paper we study proper 2-coloring game on Tn,i by using Sprague–Grundy function and give the optimal strategy of proper 2-coloring game on Tn,i.
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 callDisclaimer: 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.
