Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2607.08364

Roman domination on subclasses of bipartite graphs

Gautam K. Das·Sasmita Rout·Kamal Santra
View original source ↗Read source document ↗Export metadata ↓

Abstract

The Roman Domination Problem (RDP) on a simple, finite, undirected graph \(G=(V,E)\) asks for a labeling function \(f:V\rightarrow\{0,1,2\}\) such that every vertex assigned value \(0\) is adjacent to at least one vertex assigned value \(2\). The objective is to minimize the total weight \(\sum_{v\in V} f(v)\), and this minimum value is called the Roman domination number of \(G\), denoted by \(γ_R(G)\). Since the RDP is NP-complete for bipartite graphs, a natural direction is to study its complexity on restricted subclasses of bipartite graphs. The problem remains NP-complete even under strong structural restrictions, such as star-convex and comb-convex bipartite graphs. Therefore, identifying the borderline subclasses where the problem changes from NP-complete to polynomial-time solvable remains an important challenge. In this paper, we investigate the RDP on convex bipartite graphs and on their superclass, chordal bipartite graphs. First, we present a dynamic programming algorithm for convex bipartite graphs. The algorithm uses the interval ordering of one bipartition class and keeps a compact boundary state, which is sufficient to control the domination requirements of both processed and future vertices. This gives an \(O(n^3)\)-time algorithm for computing \(γ_R(G)\) on an \(n\) vertex convex bipartite graph. In contrast, we prove that the decision version of the RDP is NP-complete on chordal bipartite graphs by a polynomial reduction from \textsc{Dominating Set} on chordal bipartite graphs. Thus, our results show a clear separation between the tractability of convex bipartite graphs and the hardness of the larger chordal bipartite class.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Gautam K. Das, Sasmita Rout, Kamal Santra. 2026-07-09. Roman domination on subclasses of bipartite graphs. https://arxiv.org/abs/2607.08364

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO↗
arXiv2026

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO↗