Research
Research
Research
Research
209+ open-access research outputs.
Roman-type domination parameters form an important class of graph invariants that model protection and resource allocation problems on networks. Among them, $[k]$-Roman domination provides a unified f…
Motivated by resource defense models in networks, such as protecting territories with varying legion strengths, let $k \geq 2$ be an integer. Roman $k$-domination and strong Roman $k$-domination gener…
In this paper, we study the $[k]$-Roman domination number of cylindrical graphs $C_m \Box P_n$. Our analysis begins with a general lower bound based on local neighborhood constraints, showing that $\g…
Let $G$ be a graph with vertex set $V=V(G)$. A double Roman dominating function on a graph $G$ is a function $f : V \to \{0,1,2,3\}$ satisfying the conditions that if $f(v) = 0$, then vertex $v$ must …
We establish the following quantitative form of the Green--Tao theorem: if a set $\mathcal{A}$ of relative density $\delta$ within the primes up to $N$ contains no nontrivial arithmetic progressions o…
Roman domination and its higher-order extensions have attracted considerable attention due to their natural interpretation in terms of defensive resource allocation on networks. The recently introduce…
The \textsc{Dominating Set} problem is a classical and extensively studied topic in graph theory and theoretical computer science. In this paper, we examine the algorithmic complexity of several well-…
A total Roman dominating function (TRDF) on a graph $G$ with no isolated vertices is a function $f:V(G)\to\{0,1,2\}$ such that every vertex $v$ with $f(v)=0$ has a neighbor assigned $2$, and the subgr…
We consider the 2-limited packing problem: for a graph $G=(V,E)$ one seeks to find a maximum cardinality subset $B\subseteq V$, such that, for all $v\in V$, the closed neighbourhood of $v$ contains at…
A Roman dominating function of a graph $G=(V,E)$ is a labeling $f: V \rightarrow{} \{0 ,1, 2\}$ such that for each vertex $u \in V$ with $f(u) = 0$, there exists a vertex $v \in N(u)$ with $f(v) =2$. …
We use contemporary mathematical notation to describe the method for determining the age of the ecclesiastical moon as mandated by pope Gregory XIII and elaborated in the book of Christopher Clavius \…
A Roman dominating function for a (non-weighted) graph $G=(V,E)$, is a function $f:V\rightarrow \{0,1,2\}$ such that every vertex $u\in V$ with $f(u)=0$ has at least {one} neighbor $v\in V$ such that …
The ceiling of the Buttery in All Souls College, Oxford, designed by the English Baroque architect Nicholas Hawksmoor, has a vaulted form on an oval base. It is coffered with an array of approximately…
Although Extension Perfect Roman Domination is NP-complete, all minimal (with respect to the pointwise order) perfect Roman dominating functions can be enumerated with polynomial delay. This algorithm…
Given a graph $G$ with vertex set $V$, $f : V \rightarrow \{0, 1, 2\}$ is a \emph{Roman $\{2\}$-dominating function} (or \emph{italian dominating function}) of $G$ if for every vertex $v\in V$ with $f…
Let $A(s) = \sum_n a_n n^{-s}$ be a Dirichlet series with meromorphic continuation. Say we are given information on the poles of $A(s)$ with $|\Im s| \leq T$ for some large constant $T$. What is the b…
For a positive integer $k$, a $\{k\}$-Roman dominating function of a graph $G = (V,E)$ is a function $f\colon V \rightarrow \{0,1,\ldots,k\}$ satisfying $f (N(v)) \geq k$ for each vertex $v\in V$ with…
We reprove the generalized Nandakumar-Ramana Rao conjecture for the prime case using representation ring-graded Bredon cohomology. Our approach relies solely on the $RO(C_p)$-graded cohomology of conf…
Thirty years ago, in a seminal paper Ramana derived an exact dual for Semidefinite Programming (SDP). Ramana's dual has the following remarkable features: i) it is an explicit, polynomial size semidef…
This is the first of a series of two articles aiming at relating the compact Fukaya category of a Weinstein manifold to the derived category of finite dimensional representations of the Chekanov-Elias…
Free open-access publishing with Google Scholar indexing.
Submission Guide →