Akira Hiraki

According to our database1, Akira Hiraki authored at least 31 papers between 1993 and 2012.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2012
A Characterization of the Hamming Graphs and the Dual Polar Graphs by Completely Regular Subgraphs.
Graphs Comb., 2012

2010
Delsarte Set Graphs with Small <i>c</i><sub>2</sub>.
Graphs Comb., 2010

2009
Distance-Regular Graph with <i>c</i><sub>2</sub> > 1 and <i>a</i><sub>1</sub> = 0 <i>a</i><sub>2</sub>.
Graphs Comb., 2009

A characterization of some distance-regular graphs by strongly closed subgraphs.
Eur. J. Comb., 2009

2008
Strongly Closed Subgraphs in a Distance-Regular Graph with <i>c</i> <sub>2</sub> > 1.
Graphs Comb., 2008

A characterization of the Hamming graph by strongly closed subgraphs.
Eur. J. Comb., 2008

2007
A characterization of the Odd graphs and the doubled Odd graphs with a few of their intersection numbers.
Eur. J. Comb., 2007

Delsarte clique graphs.
Eur. J. Comb., 2007

2006
Improving diameter bounds for distance-regular graphs.
Eur. J. Comb., 2006

2005
A generalization of an inequality of Brouwer-Wilbrink.
J. Comb. Theory, Ser. A, 2005

Applications of the retracing method for distance-regular graphs.
Eur. J. Comb., 2005

2004
A Note on Regular Near Polygons.
Graphs Comb., 2004

2003
The Number of Columns (1, k-2, 1) in the Intersection Array of a Distance-Regular Graph.
Graphs Comb., 2003

A distance-regular graph with bipartite geodetically closed subgraphs.
Eur. J. Comb., 2003

A characterization of the doubled Grassmann graphs, the doubled Odd graphs, and the Odd graphs by strongly closed subgraph.
Eur. J. Comb., 2003

2000
Retracing Argument for Distance-Regular Graphs.
J. Comb. Theory, Ser. B, 2000

1999
Distance-regular Graphs of the Height <i>h</i>.
Graphs Comb., 1999

Strongly Closed Subgraphs in a Regular Thick Near Polygon.
Eur. J. Comb., 1999

An Application of a Construction Theory of Strongly Closed Subgraphs in a Distance-regular Graph.
Eur. J. Comb., 1999

1998
Distance-regular Subgraphs in a Distance-regular Graph, VI.
Eur. J. Comb., 1998

Distance-regular Subgraphs in a Distance-regular Graph, V.
Eur. J. Comb., 1998

1997
Distance-regular Subgraphs in a Distance-regular Graph, IV.
Eur. J. Comb., 1997

Distance-regular Graphs with b<sub>2</sub>=1 and Antipodal Covers.
Eur. J. Comb., 1997

1996
Distance-Regular Graphs with <i>b</i><sub><i>t</i></sub>=1 and Antipodal Double-Covers.
J. Comb. Theory, Ser. B, 1996

A constant bound on the number of columns (1, <i>k</i> - 2, 1) in the intersection array of a distance-regular graph.
Graphs Comb., 1996

Distance-regular Subgraphs in a Distance-regular Graph, III.
Eur. J. Comb., 1996

1995
On distance-regular graphs with<i>k</i><sub><i>i</i></sub> =<i>k</i><sub><i>j</i></sub>, II.
Graphs Comb., 1995

Distance-regular subgraphs in a distance-regular graph, II.
Eur. J. Comb., 1995

Distance-regular subgraphs in a distance-regular graph, I.
Eur. J. Comb., 1995

1994
An Improvement of the Boshier-Nomura Bound.
J. Comb. Theory, Ser. B, 1994

1993
A Circuit Chasing Technique in a Distance-regular Graph with Triangles.
Eur. J. Comb., 1993


  Loading...