Search citation statements
Paper Sections
Citation Types
Year Published
Publication Types
Relationship
Authors
Journals
The Maker-Breaker resolving game is a game played on a graph G by Resolver and Spoiler. The players taking turns alternately in which each player selects a not yet played vertex of G. The goal of Resolver is to select all the vertices in a resolving set of G, while that of Spoiler is to prevent this from happening. The outcome o(G) of the game played is one of $$\mathcal {R}$$ R , $$\mathcal {S}$$ S , and $$\mathcal {N}$$ N , where $$o(G)=\mathcal {R}$$ o ( G ) = R (resp. $$o(G)=\mathcal {S}$$ o ( G ) = S ), if Resolver (resp. Spoiler) has a winning strategy no matter who starts the game, and $$o(G)=\mathcal {N}$$ o ( G ) = N , if the first player has a winning strategy. In this paper, the game is investigated on corona products $$G\odot H$$ G ⊙ H of graphs G and H. It is proved that if $$o(H)\in \{\mathcal {N}, \mathcal {S}\}$$ o ( H ) ∈ { N , S } , then $$o(G\odot H) = \mathcal {S}$$ o ( G ⊙ H ) = S . No such result is possible under the assumption $$o(H) = \mathcal {R}$$ o ( H ) = R . It is proved that $$o(G\odot P_k) = \mathcal {S}$$ o ( G ⊙ P k ) = S if $$k=5$$ k = 5 , otherwise $$o(G\odot P_k) = \mathcal {R}$$ o ( G ⊙ P k ) = R , and that $$o(G\odot C_k) = \mathcal {S}$$ o ( G ⊙ C k ) = S if $$k=3$$ k = 3 , otherwise $$o(G\odot C_k) = \mathcal {R}$$ o ( G ⊙ C k ) = R . Several results are also given on corona products in which the second factor is of diameter at most 2.
The Maker-Breaker resolving game is a game played on a graph G by Resolver and Spoiler. The players taking turns alternately in which each player selects a not yet played vertex of G. The goal of Resolver is to select all the vertices in a resolving set of G, while that of Spoiler is to prevent this from happening. The outcome o(G) of the game played is one of $$\mathcal {R}$$ R , $$\mathcal {S}$$ S , and $$\mathcal {N}$$ N , where $$o(G)=\mathcal {R}$$ o ( G ) = R (resp. $$o(G)=\mathcal {S}$$ o ( G ) = S ), if Resolver (resp. Spoiler) has a winning strategy no matter who starts the game, and $$o(G)=\mathcal {N}$$ o ( G ) = N , if the first player has a winning strategy. In this paper, the game is investigated on corona products $$G\odot H$$ G ⊙ H of graphs G and H. It is proved that if $$o(H)\in \{\mathcal {N}, \mathcal {S}\}$$ o ( H ) ∈ { N , S } , then $$o(G\odot H) = \mathcal {S}$$ o ( G ⊙ H ) = S . No such result is possible under the assumption $$o(H) = \mathcal {R}$$ o ( H ) = R . It is proved that $$o(G\odot P_k) = \mathcal {S}$$ o ( G ⊙ P k ) = S if $$k=5$$ k = 5 , otherwise $$o(G\odot P_k) = \mathcal {R}$$ o ( G ⊙ P k ) = R , and that $$o(G\odot C_k) = \mathcal {S}$$ o ( G ⊙ C k ) = S if $$k=3$$ k = 3 , otherwise $$o(G\odot C_k) = \mathcal {R}$$ o ( G ⊙ C k ) = R . Several results are also given on corona products in which the second factor is of diameter at most 2.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
customersupport@researchsolutions.com
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.