List of Publications
  1. A circuit chasing technique in a distance-regular graph with triangles
  2. An improvement of the Boshier-Nomura bound.
  3. Circuit chasing technique for a distance-regular graph with c2r+1=1
  4. Distance-regular subgraphs in a distance-regular graph, I
  5. Distance-regular subgraphs in a distance-regular graph, II
  6. Distance-regular subgraphs in a distance-regular graph, III
  7. A constant bound on the number of columns (1,k-2,1) in the intersection array of distance-regular graphs,
  8. Distance-regular subgraphs in a distance-regular graph, IV
  9. Distance-regular subgraphs in a distance-regular graph, V,
  10. Distance-regular subgraphs in a distance-regular graph, VI,
  11. Distance-regular graph of the height h,
  12. An application of a constduction theory of strongly closed subgraphs in a distance-regular graph,
  13. Strongly closed subgraphs in a regular thick near polygon,
  14. Geodecically closed subgraphs in a distance-regular graph
  15. Retracing argument for distance-regular graphs,
  16. A distance-regular graph with strongly closed subgraphs,
  17. A characterization of the doubled Grassmann graphs, the doubled Odd graphs, and the Odd graphs by strongly closed subgraphs,
  18. The number of columns (1,k-2,1) in the intersection array of a distance-regular graph,
  19. A distance-regular graph with bipartite geodetically closed subgraphs,
  20. Applications of the retracing method for distance-regular graphs,
  21. A Characterization of the Odd graphs and the doubled Odd graphs with a few of their intersection numbers
  22. A characterization of the Hamming graph by strongly closed subgraphs
  23. Strongly closed subgraphs in a distance-regular graph with c2 > 1
  24. A characterization of some distance-regular graphs by strongly closed subgraphs
  25. Distance-regular graph with c2 >1 and a1 = 0 < a1
  26. A Characterization of the Hamming Graphs and the Dual Polar Graphs by Completely Regular Subgraphs
  1. On distance-regular graphs with b1 = cd-1
  2. On distance-regular graphs with ki = kj, II
  3. Distance-regular graphs with bt = 1 and antipodal double covers,
  4. Distance-regular graphs with b2 = 1 and antipodal covers,
  5. Distance-regular graphs with ci = bd-i and antipodal double covers,
  6. On distance-regular graphs with c4 = 1 and a1 ≠ a2
  7. An improvement of the Ivanov bound,
  8. On the non existance of certain distance-regular graphs,
  9. Distance-regular graphs of valency 6 and a1 = 1,
  10. An improvement of the Godsil bound,
  11. A Higman-Haemers inequality for thick regular near polygons
  12. The regular near polygons of order (s,2)
  13. A note on regular near polygons
  14. A generalization of an inequality of Brouwer-Wilbrink
  15. Improving diameter bounds for distance-regular graphs
  16. Delsarte clique graphs
  17. Delsarte Clique Graphs with small c2
Farther information