A. Batal

activity

20042026

most citedPhysical Aspects of Pseudo-Hermitian and

P T

-Symmetric Quantum Mechanics

305 citations · 352 across the 13 of their papers we have counts for

collaborators

Showing math.COShow all

6 papers · 1 filter

math.CO2026

The Reduced Smith Group of a Kneser Graph and Its Application to Group-Valued Magic Maps

Ahmet Batal

For a finite abelian group $Γ$ , a map $f : V (G) \to Γ$ is a $Γ$ -magic map if the sum of its values over the neighbors of a vertex is independent of the vertex. It is affinely gen…

math.CO2026

Algebraic characterizations of generating and affinely generating $Γ$ -magic maps and $Γ$ -distance magic labelings on regular graphs

Ahmet Batal

For an abelian group $Γ$ of order $n$ , a graph $G$ of order $n$ is $Γ$ -distance magic if it admits a bijection $V (G) \to Γ$ whose open-neighborhood sums are constant, and group dista…

math.CO2022

Bounding the multiplicities of eigenvalues of graph matrices in terms of circuit rank using a new approach

Ahmet Batal

Let $G$ be a simple undirected graph, $θ (G)$ be the circuit rank of $G$ , $η_{M} (G)$ and $m_{M} (G, λ)$ be the nullity and the multiplicity of eigenvalue $λ$ of a graph matrix $M (G)$ , res…

math.CO2021

Effects of edge addition or removal on the nullity of a graph

Ahmet Batal

Lights Out is a game which can be played on any graph $G$ . Initially we have a configuration which assigns one of the two states on or off to each vertex. The aim of the game is to…

math.CO2020

Parity of an odd dominating set

Ahmet Batal

For a simple graph $G$ with vertex set $V (G) = {v_{1}, ..., v_{n}}$ , we define the closed neighborhood set of a vertex $u$ 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 $G$ . A configuration assigns one of the two states \emph{on} or \emph{off} to each vertex. For a given configuration, th…

The Reduced Smith Group of a Kneser Graph and Its Application to Group-Valued Magic Maps

Algebraic characterizations of generating and affinely generating Γ-magic maps and Γ-distance magic labelings on regular graphs

Bounding the multiplicities of eigenvalues of graph matrices in terms of circuit rank using a new approach

Effects of edge addition or removal on the nullity of a graph

Parity of an odd dominating set

A characterization of always solvable trees in the Lights Out game using the activation types of vertices

Algebraic characterizations of generating and affinely generating $Γ$ -magic maps and $Γ$ -distance magic labelings on regular graphs