ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
Discrete Mathematics
Volume 114, Issues 1-3, 28 April 1993, Pages 237-252
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Purchase PDF (1111 K)

Article Toolbox
 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/0012-365X(93)90369-5    
How to Cite or Link Using DOI (Opens New Window)

Copyright © 1993 Published by Elsevier Science B.V. All rights reserved.

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

Purchase the full-text article



References and further reading may be available for this article. To view references and further reading you must purchase this article.

Tayuan HuangCorresponding Author Contact Information

Monique Laurent

Department of Applied Mathematics, National Chiao-Tung University, Hsin-Chu 30050, Taiwan, China

LIENS, Ecole Normale Supérieure 45 rue d'Ulm, 75230 Paris cedex 05, France


Received 20 January 1989; 
revised 22 February 1989. 
Available online 27 March 2002.

Abstract

The equivalence between Bruck nets and mutually orthogonal latin squares is extended to (s, r; μ)- nets and mutually orthogonal quasi frequency squares. We investigate geometries arising from classical forms such as bilinear forms, alternating bilinear forms, hermitian forms and symmetric forms and show that (s, r; μ)-nets provide the right building blocks for each of these geometries with suitable values of μ. Toward the goal of geometric classification of distance-regular graphs, the local structure of the case of alternating forms graphs is stressed.

Article Outline

• References

Corresponding Author Contact Information Correspondence to: Tayuan Huang, Department of Applied Mathematics, National Chiao-Tung University, Hsin-chu 30050, Taiwan, China


Discrete Mathematics
Volume 114, Issues 1-3, 28 April 1993, Pages 237-252
 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2009 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.