# Independent Double Roman Domination on Block Graphs

## TL;DR

This paper introduces a linear-time algorithm for computing the independent double Roman domination number in block graphs by transforming the problem into an induced independent domination problem on a block-cutpoint graph.

## Contribution

It presents a novel linear-time dynamic programming algorithm for independent double Roman domination on block graphs, transforming the problem via block-cutpoint graph analysis.

## Key findings

- Linear time algorithm for independent double Roman domination number
- Transformation of the problem to block-cutpoint graph
- Efficient computation for connected block graphs

## Abstract

Given a graph $G=(V,E)$, $f:V \rightarrow \{0,1,2 \}$ is the Italian dominating function of $G$ if $f$ satisfies $\sum_{u \in N(v)}f(u) \geq 2$ when $f(v)=0$. Denote $w(f)=\sum_{v \in V}f(v)$ as the weight of $f$. Let $V_i=\{v:f(v)=i\},i=0,1,2$, we call $f$ the independent Italian dominating function if $V_1 \cup V_2$ is an independent set. The independent Italian domination number of $G$ is the minimum weight of independent Italian dominating function $f$, denoted by $i_{I}(G)$. We equivalently transform the independent domination problem of the connected block graph $G$ to the induced independent domination problem of its block-cutpoint graph $T$, then a linear time algorithm is given to find $i_{I}(G)$ of any connected block graph $G$ based on dynamic programming.