3 papers
math.CO2026
Completely Independent Spanning Trees in -Outerplanar Triangulated Discs
Toru Araki
Let be spanning trees of a graph . For any pair of vertices and , if the -- paths in the 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 , a vertex dominates itself and its neighbors. A subset of vertices of is a double dominating set of 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 of vertices in a graph is a secure total dominating set of if is a total dominating set of and, for each vertex , there is a vertex $v \in…