---

List of Publications

---

1. A circuit chasing technique in a distance-regular graph with triangles
   European J. Combin. 14, no 5, pp 413--420, (1993).

2. An improvement of the Boshier-Nomura bound.
   J. Combin. Theory Ser B, 61, no 1, pp 1--4, (1994)

3. Circuit chasing technique for a distance-regular graph with c_2r+1=1
   Kyushu J. Math, 49, no 1, pp 197--219, (1995).

4. Distance-regular subgraphs in a distance-regular graph, I
   European J. Combin. 16, no 6, pp 586--602 (1995)

5. Distance-regular subgraphs in a distance-regular graph, II
   European J. Combin. 16, no 6, pp 603--615, (1995)

6. Distance-regular subgraphs in a distance-regular graph, III
   European J. Combin. 17, no 7, pp 629--636, (1996)

7. A constant bound on the number of columns (1,k-2,1) in the intersection array of distance-regular graphs,
   Graphs and Combin. 12, no 1, pp 23--37, (1996)

8. Distance-regular subgraphs in a distance-regular graph, IV
   European J. Combin. 18, no 6, pp 635--645, (1997)

9. Distance-regular subgraphs in a distance-regular graph, V,
   European J. Combin. 19, no 2, pp 141--150, (1998)

10. Distance-regular subgraphs in a distance-regular graph, VI,
    European J. Combin. 19, no 8, pp 953--965, (1998)

11. Distance-regular graph of the height h,
    Graphs and Combin. 15, no 4, pp 417--428, (1999)

12. An application of a constduction theory of strongly closed subgraphs in a distance-regular graph,
    European J. Combin. 20, no 4, pp 271--278, (1999)

13. Strongly closed subgraphs in a regular thick near polygon,
    European J. Combin. 20, no 8, pp 789--796, (1999)

14. Geodecically closed subgraphs in a distance-regular graph
    Kyushu. J. Math. 54, no. 1, pp 155--164, (2000)

15. Retracing argument for distance-regular graphs,
    J. Combin. Theory Ser B, 79, no 2, pp 211--220, (2000)

16. A distance-regular graph with strongly closed subgraphs,
    J. Alg. Combin. 14, no 2, pp 127--131, (2001)

17. A characterization of the doubled Grassmann graphs, the doubled Odd graphs, and the Odd graphs by strongly closed subgraphs,
    European J. Combin. 24, no 2, pp 161--171, (2003)

18. The number of columns (1,k-2,1) in the intersection array of a distance-regular graph,
    Graphs and Combin. 19, no 3, pp 371--387, (2003)

19. A distance-regular graph with bipartite geodetically closed subgraphs,
    European J. Combin. 24, no 4, pp 349--363, (2003)

20. Applications of the retracing method for distance-regular graphs,
    European J. Combin. 26, no 5, pp 717-727, (2005)

21. A Characterization of the Odd graphs and the doubled Odd graphs with a few of their intersection numbers
    European J. Combin. 28, no 1, pp 246-257, (2007)

22. A characterization of the Hamming graph by strongly closed subgraphs
    European J. Combin. 29, no 7, pp 1603-1616, (2008)

23. Strongly closed subgraphs in a distance-regular graph with c₂ > 1
    Graphs and Combin. 24, no 6, pp 537--550, (2008)

24. A characterization of some distance-regular graphs by strongly closed subgraphs
    European J. Combin. 30, no 4, pp 893-907, (2009)

25. Distance-regular graph with c₂ >1 and a₁ = 0 < a₁
    Graphs and Combin. 25, no 1, pp 65--75, (2009)

26. A Characterization of the Hamming Graphs and the Dual Polar Graphs by Completely Regular Subgraphs
    to appear in Graphs and Combin.

---

1. On distance-regular graphs with b₁ = c_d-1
   Math. Japonica. 37, no 4, pp 751--756, (1992). ( with H. Suzuki )

2. On distance-regular graphs with k_i = k_j, II
   Graphs and Comibin. 11, no 4 pp 305--317, (1995). ( with H. Suzuki and M. Wajima )

3. Distance-regular graphs with b_t = 1 and antipodal double covers,
   J. Combin Theory Ser B, 6, no. 2, pp 278--283, 7 (1996). ( with M. Araya and A. Jurisic )

4. Distance-regular graphs with b₂ = 1 and antipodal covers,
   European J. Combin. 18, no 3, pp 243--248, (1997) ( with M. Araya and A. Jurisic )

5. Distance-regular graphs with c_i = b_d-i and antipodal double covers,
   J. Alg. Combin. 8, no 2, pp 127--138 (1998). ( with M. Araya )

6. On distance-regular graphs with c₄ = 1 and a₁ ≠ a₂
   Kyushu. J. Math. 52, no. 2, pp 265--277, (1998). ( with Y. L. Chen and J. Koolen)

7. An improvement of the Ivanov bound,
   Ann. Combin. 2, no. 2, pp 131--135, (1998) ( with J. Koolen )

8. On the non existance of certain distance-regular graphs,
   Kyushu. J. Math. 53, no. 1, pp 1--15, (1999). ( with Y. L. Chen )

9. Distance-regular graphs of valency 6 and a₁ = 1,
   J. Alg. Combin 11, no 2, pp 101--134, (2000) ( with K. Nomura and H. Suzuki )

10. An improvement of the Godsil bound,
    Ann. Combin. 2, no. 1, pp 33--44, (2002) ( with J. Koolen )

11. A Higman-Haemers inequality for thick regular near polygons
    J. Alg. Combin. 20, no. 2, pp 213--218, (2004). ( with J. Koolen )

12. The regular near polygons of order (s,2)
    J. Alg. Combin. 20, no. 2, pp 219--235, (2004). ( with J. Koolen )

13. A note on regular near polygons
    Graphs and Combin. 20, no 4, pp 485--497, (2004). ( with J. Koolen )

14. A generalization of an inequality of Brouwer-Wilbrink
    J. Combin Theory Ser A, 109, no. 1, pp 181--188, (2005). ( with J. Koolen )

15. Improving diameter bounds for distance-regular graphs
    European J. Combin. 27, no 1, pp 79--89, (2006). ( with S. Bang and J. Koolen )

16. Delsarte clique graphs
    European J. Combin. 28, no 2, pp 501-516, (2007). ( with S. Bang and J. Koolen )

17. Delsarte Clique Graphs with small c₂
    Graphs and Combin. 26, no 2, pp 147--162, (2010). ( with S. Bang and J. Koolen )

---