 | 2009 |
|---|
| 15 |       | Toru Araki:
Labeling bipartite permutation graphs with a condition at distance two.
Discrete Applied Mathematics 157(8): 1677-1686 (2009) |
| 2008 |
|---|
| 14 | | Toru Araki:
The k-tuple twin domination in de Bruijn and Kautz digraphs.
Discrete Mathematics 308(24): 6406-6413 (2008) |
| 2007 |
|---|
| 13 | | Toru Araki:
On the k-tuple domination of de Bruijn and Kautz digraphs.
Inf. Process. Lett. 104(3): 86-90 (2007) |
| 12 | | Toru Araki,
Yosuke Kikuchi:
Hamiltonian laceability of bubble-sort graphs with edge faults.
Inf. Sci. 177(13): 2679-2691 (2007) |
| 2006 |
|---|
| 11 | | Yosuke Kikuchi,
Toru Araki:
Edge-bipancyclicity and edge-fault-tolerant bipancyclicity of bubble-sort graphs.
Inf. Process. Lett. 100(2): 52-59 (2006) |
| 10 | | Toru Araki:
Hyper hamiltonian laceability of Cayley graphs generated by transpositions.
Networks 48(3): 121-124 (2006) |
| 2005 |
|---|
| 9 | | Yosuke Kikuchi,
Toru Araki:
Edge-bipancyclicity and edge-fault-tolerant bipancyclicity of bubble-sort graphs.
ISPAN 2005: 46-51 |
| 8 | | Aya Okashita,
Toru Araki,
Yukio Shibata:
Adaptive Diagnosis of Variants of the Hypercube.
IEICE Transactions 88-A(3): 728-735 (2005) |
| 2004 |
|---|
| 7 | | Satoshi Fujita,
Toru Araki:
Three-Round Adaptive Diagnosis in Binary n-Cubes.
ISAAC 2004: 442-451 |
| 6 | | Toru Araki:
Optimal Adaptive Fault Diagnosis of Cubic Hamiltonian Graphs.
ISPAN 2004: 162-167 |
| 2003 |
|---|
| 5 | | Toru Araki,
Yukio Shibata:
(t, k)-Diagnosable System: A Generalization of the PMC Models.
IEEE Trans. Computers 52(7): 971-975 (2003) |
| 4 | | Toru Araki:
Edge-pancyclicity of recursive circulants.
Inf. Process. Lett. 88(6): 287-292 (2003) |
| 2002 |
|---|
| 3 |  | Toru Araki,
Masayuki Kogure,
Yukio Shibata:
Combinatorial properties of the divisibilty of mn by am + bn + c.
Ars Comb. 64: 3- (2002) |
| 2 | | Toru Araki,
Yukio Shibata:
Pancyclicity of recursive circulant graphs.
Inf. Process. Lett. 81(4): 187-190 (2002) |
| 1999 |
|---|
| 1 | | Toru Araki,
Yukio Shibata:
Isomorphic factorization of complete bipartite graph into forest.
Ars Comb. 53: (1999) |
