Isomorphic factorization of complete bipartite graph into forest. - Toru Araki; Yukio Shibata (Ars Comb., 1999)

Combinatorial properties of the divisibilty of mn by am + bn + c. - Toru Araki; Masayuki Kogure; Yukio Shibata (Ars Comb., 2002)

Optimal Diagnosable Systems on Cayley Graphs. - Toru Araki; Yukio Shibata (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2002)

Efficient Diagnosis Algorithms on Butterfly Networks under the Comparison Approach. - Toru Araki; Yukio Shibata (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2002)

Diagnosability of Butterfly Networks under the Comparison Approach. - Toru Araki; Yukio Shibata (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2002)

Pancyclicity of recursive circulant graphs. - Toru Araki; Yukio Shibata (Inf. Process. Lett., 2002)

An Optimal Adaptive Diagnosis of Butterfly Networks. - Aya Okashita; Toru Araki; Yukio Shibata (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2003)

Edge-pancyclicity of recursive circulants. - Toru Araki (Inf. Process. Lett., 2003)

(t, k)-Diagnosable System: A Generalization of the PMC Models. - Toru Araki; Yukio Shibata (IEEE Trans. Computers, 2003)

Three-Round Adaptive Diagnosis in Binary n-Cubes. - Satoshi Fujita; Toru Araki (ISAAC, 2004)

Optimal Adaptive Fault Diagnosis of Cubic Hamiltonian Graphs. - Toru Araki (ISPAN, 2004)

Adaptive Diagnosis of Variants of the Hypercube. - Aya Okashita; Toru Araki; Yukio Shibata (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2005)

Edge-bipancyclicity and edge-fault-tolerant bipancyclicity of bubble-sort graphs. - Yosuke Kikuchi; Toru Araki (Inf. Process. Lett., 2006)

Hyper hamiltonian laceability of Cayley graphs generated by transpositions. - Toru Araki (Networks, 2006)

On the k-tuple domination of de Bruijn and Kautz digraphs. - Toru Araki (Inf. Process. Lett., 2007)

Hamiltonian laceability of bubble-sort graphs with edge faults. - Toru Araki; Yosuke Kikuchi (Inf. Sci., 2007)

The k-tuple twin domination in de Bruijn and Kautz digraphs. - Toru Araki (Discret. Math., 2008)

Labeling bipartite permutation graphs with a condition at distance two. - Toru Araki (Discret. Appl. Math., 2009)

Connected k-tuple twin domination in de Bruijn and Kautz digraphs. - Toru Araki (Discret. Math., 2009)

Bipancyclic properties of Cayley graphs generated by transpositions. - Yuuki Tanaka; Yosuke Kikuchi; Toru Araki; Yukio Shibata (Discret. Math., 2010)

On the distance preserving trees in graphs. - Toru Araki; Shingo Osawa; Takashi Shimizu (CoRR, 2014)

Twin Domination Problems in Round Digraphs. - Tamaki Nakajima; Yuuki Tanaka; Toru Araki (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2014)

Dirac's Condition for Completely Independent Spanning Trees. - Toru Araki (J. Graph Theory, 2014)

Completely independent spanning trees in (partial) k-trees. - Toru Araki; Masayoshi Matsushita; Yota Otachi (Discuss. Math. Graph Theory, 2015)

Secure domination in proper interval graphs. - Toru Araki; Hiroka Miyazaki (Discret. Appl. Math., 2018)

On the secure domination numbers of maximal outerplanar graphs. - Toru Araki; Issei Yumoto (Discret. Appl. Math., 2018)

Secure domination in cographs. - Toru Araki; Ryo Yamanaka (Discret. Appl. Math., 2019)

Partitioning vertices into in- and out-dominating sets in digraphs. - Kosuke Nakamura; Toru Araki (Discret. Appl. Math., 2020)

Minimum Stretch Spanning Tree Problem in Operations on Trees. - Toru Araki; Eito Hasegawa; Shion Kato (J. Interconnect. Networks, 2022)

Correcting the algorithm for a minimum secure dominating set of proper interval graphs by Zou, Liu, Hsu and Wang. - Toru Araki; Ryuya Saito (Discret. Appl. Math., 2023)

Secure total domination number in maximal outerplanar graphs. - Yasufumi Aita; Toru Araki (Discret. Appl. Math., 2024)

A lower bound for secure domination number of an outerplanar graph. - Toru Araki (Discret. Appl. Math., 2024)

An algorithm for the secure total domination problem in proper interval graphs. - Toru Araki; Yasufumi Aita (Theor. Comput. Sci., 2024)