The SCEAS System
| |||||||

## Search the dblp DataBase
Akira Hiraki:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- S. Bang, Akira Hiraki, Jacobus H. Koolen
**Improving diameter bounds for distance-regular graphs.**[Citation Graph (0, 0)][DBLP] Eur. J. Comb., 2006, v:27, n:1, pp:79-89 [Journal] - Makoto Araya, Akira Hiraki, Aleksandar Jurisic
**Distance-regular Graphs with b**[Citation Graph (0, 0)][DBLP]_{2}=1 and Antipodal Covers. Eur. J. Comb., 1997, v:18, n:3, pp:243-248 [Journal] - Akira Hiraki
**A characterization of the doubled Grassmann graphs, the doubled Odd graphs, and the Odd graphs by strongly closed subgraph.**[Citation Graph (0, 0)][DBLP] Eur. J. Comb., 2003, v:24, n:2, pp:161-171 [Journal] - Akira Hiraki
**A distance-regular graph with bipartite geodetically closed subgraphs.**[Citation Graph (0, 0)][DBLP] Eur. J. Comb., 2003, v:24, n:4, pp:349-363 [Journal] - Akira Hiraki
**Applications of the retracing method for distance-regular graphs.**[Citation Graph (0, 0)][DBLP] Eur. J. Comb., 2005, v:26, n:5, pp:717-727 [Journal] - Akira Hiraki
**A Circuit Chasing Technique in a Distance-regular Graph with Triangles.**[Citation Graph (0, 0)][DBLP] Eur. J. Comb., 1993, v:14, n:5, pp:413-420 [Journal] - Akira Hiraki
**Distance-regular Subgraphs in a Distance-regular Graph, III.**[Citation Graph (0, 0)][DBLP] Eur. J. Comb., 1996, v:17, n:7, pp:629-636 [Journal] - Akira Hiraki
**Distance-regular Subgraphs in a Distance-regular Graph, IV.**[Citation Graph (0, 0)][DBLP] Eur. J. Comb., 1997, v:18, n:6, pp:635-645 [Journal] - Akira Hiraki
**Distance-regular Subgraphs in a Distance-regular Graph, V.**[Citation Graph (0, 0)][DBLP] Eur. J. Comb., 1998, v:19, n:2, pp:141-150 [Journal] - Akira Hiraki
**Distance-regular Subgraphs in a Distance-regular Graph, VI.**[Citation Graph (0, 0)][DBLP] Eur. J. Comb., 1998, v:19, n:8, pp:953-965 [Journal] - Akira Hiraki
**An Application of a Construction Theory of Strongly Closed Subgraphs in a Distance-regular Graph.**[Citation Graph (0, 0)][DBLP] Eur. J. Comb., 1999, v:20, n:4, pp:271-278 [Journal] - Akira Hiraki
**Strongly Closed Subgraphs in a Regular Thick Near Polygon.**[Citation Graph (0, 0)][DBLP] Eur. J. Comb., 1999, v:20, n:8, pp:789-796 [Journal] - Akira Hiraki
**A characterization of the Odd graphs and the doubled Odd graphs with a few of their intersection numbers.**[Citation Graph (0, 0)][DBLP] Eur. J. Comb., 2007, v:28, n:1, pp:246-257 [Journal] - S. Bang, Akira Hiraki, Jacobus H. Koolen
**Delsarte clique graphs.**[Citation Graph (0, 0)][DBLP] Eur. J. Comb., 2007, v:28, n:2, pp:501-516 [Journal] - Akira Hiraki
**The Number of Columns (1, k-2, 1) in the Intersection Array of a Distance-Regular Graph.**[Citation Graph (0, 0)][DBLP] Graphs and Combinatorics, 2003, v:19, n:3, pp:371-387 [Journal] - Akira Hiraki, Jack H. Koolen
**A Note on Regular Near Polygons.**[Citation Graph (0, 0)][DBLP] Graphs and Combinatorics, 2004, v:20, n:4, pp:485-497 [Journal] - Makoto Araya, Akira Hiraki, Aleksandar Jurisic
**Distance-Regular Graphs with**[Citation Graph (0, 0)][DBLP]*b*_{t}=1 and Antipodal Double-Covers. J. Comb. Theory, Ser. B, 1996, v:67, n:2, pp:278-283 [Journal] - Akira Hiraki
**Retracing Argument for Distance-Regular Graphs.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 2000, v:79, n:2, pp:211-220 [Journal] - Akira Hiraki
**An Improvement of the Boshier-Nomura Bound.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1994, v:61, n:1, pp:1-4 [Journal] - Akira Hiraki, Jack H. Koolen
**A generalization of an inequality of Brouwer-Wilbrink.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. A, 2005, v:109, n:1, pp:181-188 [Journal] **A characterization of the Hamming graph by strongly closed subgraphs.**[Citation Graph (, )][DBLP]**A characterization of some distance-regular graphs by strongly closed subgraphs.**[Citation Graph (, )][DBLP]
Search in 0.005secs, Finished in 0.006secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |