305 citations · 352 across the 13 of their papers we have counts for
Showing 2020 · math.COShow all
2 papers · 2 filters
math.CO2020
Parity of an odd dominating set
Ahmet Batal
For a simple graph with vertex set , we define the closed neighborhood set of a vertex as $N[u]=\{v \in V(G) \; | \; v \; \text{is adjacent to} \; u \…
math.CO2020★ 2 cited
A characterization of always solvable trees in the Lights Out game using the activation types of vertices
Ahmet Batal
Lights out is a game that can be played on any simple graph . A configuration assigns one of the two states \emph{on} or \emph{off} to each vertex. For a given configuration, th…