Matches in SemOpenAlex for { <https://semopenalex.org/work/W3106283588> ?p ?o ?g. }
Showing items 1 to 53 of
53
with 100 items per page.
- W3106283588 endingPage "142" @default.
- W3106283588 startingPage "129" @default.
- W3106283588 abstract "For a subset S of vertices in a graph G , a vertex v ∈ S is an enclave of S if v and all of its neighbors are in S , where a neighbor of v is a vertex adjacent to v . A set S is enclaveless if it does not contain any enclaves. The enclaveless number Ψ( G ) of G is the maximum cardinality of an enclaveless set in G . As first observed in 1997 by Slater, if G is a graph with n vertices, then γ( G ) + Ψ( G ) = n where γ( G ) is the well-studied domination number of G . In this paper, we continue the study of the competition-enclaveless game introduced in 2001 by Philips and Slater and defined as follows. Two players take turns in constructing a maximal enclaveless set S , where one player, Maximizer, tries to maximize | S | and one player, Minimizer, tries to minimize | S | . The competition-enclaveless game number Ψ g + ( G ) of G is the number of vertices played when Maximizer starts the game and both players play optimally. We study among other problems the conjecture that if G is an isolate-free graph of order n , then Ψ g + ( G ) ≥ (1/2) n . We prove this conjecture for regular graphs and for claw-free graphs." @default.
- W3106283588 created "2020-11-23" @default.
- W3106283588 creator A5073086838 @default.
- W3106283588 creator A5089473322 @default.
- W3106283588 date "2021-08-19" @default.
- W3106283588 modified "2023-09-26" @default.
- W3106283588 title "The enclaveless competition game" @default.
- W3106283588 doi "https://doi.org/10.26493/1855-3974.2227.e1a" @default.
- W3106283588 hasPublicationYear "2021" @default.
- W3106283588 type Work @default.
- W3106283588 sameAs 3106283588 @default.
- W3106283588 citedByCount "1" @default.
- W3106283588 countsByYear W31062835882021 @default.
- W3106283588 crossrefType "journal-article" @default.
- W3106283588 hasAuthorship W3106283588A5073086838 @default.
- W3106283588 hasAuthorship W3106283588A5089473322 @default.
- W3106283588 hasBestOaLocation W31062835881 @default.
- W3106283588 hasConcept C114614502 @default.
- W3106283588 hasConcept C118615104 @default.
- W3106283588 hasConcept C132525143 @default.
- W3106283588 hasConcept C2780990831 @default.
- W3106283588 hasConcept C33923547 @default.
- W3106283588 hasConcept C80899671 @default.
- W3106283588 hasConcept C83833204 @default.
- W3106283588 hasConceptScore W3106283588C114614502 @default.
- W3106283588 hasConceptScore W3106283588C118615104 @default.
- W3106283588 hasConceptScore W3106283588C132525143 @default.
- W3106283588 hasConceptScore W3106283588C2780990831 @default.
- W3106283588 hasConceptScore W3106283588C33923547 @default.
- W3106283588 hasConceptScore W3106283588C80899671 @default.
- W3106283588 hasConceptScore W3106283588C83833204 @default.
- W3106283588 hasIssue "1" @default.
- W3106283588 hasLocation W31062835881 @default.
- W3106283588 hasLocation W31062835882 @default.
- W3106283588 hasOpenAccess W3106283588 @default.
- W3106283588 hasPrimaryLocation W31062835881 @default.
- W3106283588 hasRelatedWork W1493672327 @default.
- W3106283588 hasRelatedWork W2073028422 @default.
- W3106283588 hasRelatedWork W2104330975 @default.
- W3106283588 hasRelatedWork W2275356378 @default.
- W3106283588 hasRelatedWork W2608820967 @default.
- W3106283588 hasRelatedWork W2739579057 @default.
- W3106283588 hasRelatedWork W2762120601 @default.
- W3106283588 hasRelatedWork W2953046811 @default.
- W3106283588 hasRelatedWork W4304136511 @default.
- W3106283588 hasRelatedWork W922283457 @default.
- W3106283588 hasVolume "20" @default.
- W3106283588 isParatext "false" @default.
- W3106283588 isRetracted "false" @default.
- W3106283588 magId "3106283588" @default.
- W3106283588 workType "article" @default.