Tayuan Huang

According to our database, Tayuan Huang authored at least 13 papers between 1987 and 2010.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of two.

2010

A class of error-correcting pooling designs over complexes.

Tayuan Huang, Kaishun Wang, Chih-Wen Weng

J. Comb. Optim., 2010

2009

Error-correcting pooling designs associated with some distance-regular graphs.

Yujuan Bai, Tayuan Huang, Kaishun Wang

Discret. Appl. Math., 2009

2008

Pooling spaces associated with finite geometry.

Tayuan Huang, Kaishun Wang, Chih-Wen Weng

Eur. J. Comb., 2008

2004

Pooling spaces and non-adaptive pooling designs.

Tayuan Huang, Chih-Wen Weng

Discret. Math., 2004

Strongly Regular Graphs associated with Bent Functions.

Tayuan Huang, Kuei-Hung You

Proceedings of the 7th International Symposium on Parallel Architectures, 2004

2003

A Note on Decoding of Superimposed Codes.

Tayuan Huang, Chih-Wen Weng

J. Comb. Optim., 2003

1999

Spectral Characterization of Some Generalized Odd Graphs.

Tayuan Huang, Chao-Rong Liu

Graphs Comb., 1999

1995

Complementary <i>l</i>₁-Graphs and Related Combinatorial Structures.

Michel Deza, Tayuan Huang

Proceedings of the Combinatorics and Computer Science, 1995

1994

Spectral Characterization of Odd Graphs O_k, k ≤ 6.

Tayuan Huang

Graphs Comb., 1994

A Unified Approach to a Characterization of Grassmann Graphs and Bilinear Forms Graphs.

Tung-Shan Fu, Tayuan Huang

Eur. J. Comb., 1994

1993

(s, r; mu)-nets and alternating forms graphs.

Tayuan Huang, Monique Laurent

Discret. Math., 1993

1987

A Characterization of the Association Schemes of Bilinear Forms.

Tayuan Huang

Eur. J. Comb., 1987

An analogue of the Erdös-Ko-Rado theorem for the distance-regular graphs of bilinear forms.

Tayuan Huang

Discret. Math., 1987