Toru Araki

collaborators

4 papers

math.CO2026

Completely Independent Spanning Trees in $k$ -Outerplanar Triangulated Discs

Toru Araki

Let $T_{1}, T_{2}, \dots, T_{k}$ be $k$ spanning trees of a graph $G$ . For any pair of vertices $u$ and $v$ , if the $u$ -- $v$ paths in the $k$ spanning trees are pairwise openly dis…

math.CO2026

An Upper Bound for the Double Domination Number in Maximal Outerplanar Graphs

Toru Araki

In a graph $G$ , a vertex dominates itself and its neighbors. A subset $S$ of vertices of $G$ is a double dominating set of $G$ if every vertex is dominated by at least two vertices…

math.CO2024

Secure Total Domination Number in Maximal Outerplanar Graphs

Yasufumi Aita, Toru Araki

A subset $S$ of vertices in a graph $G$ is a secure total dominating set of $G$ if $S$ is a total dominating set of $G$ and, for each vertex $u \neq \in S$ , there is a vertex $v \in…

math.CO2024

A Lower bound for Secure Domination Number of an Outerplanar Graph

Toru Araki

A subset $S$ of vertices in a graph $G$ is a secure dominating set of $G$ if $S$ is a dominating set of $G$ and, for each vertex $u \neq \in S$ , there is a vertex $v \in S$ such tha…

Completely Independent Spanning Trees in k-Outerplanar Triangulated Discs

An Upper Bound for the Double Domination Number in Maximal Outerplanar Graphs

Secure Total Domination Number in Maximal Outerplanar Graphs

A Lower bound for Secure Domination Number of an Outerplanar Graph

Completely Independent Spanning Trees in $k$ -Outerplanar Triangulated Discs