## Abstract We present four new classes of graphs, two of which every member has a strongly almost trivial embedding, and the other two of which every member has no strongly almost trivial embeddings. We show that the property that a graph has a strongly almost trivial embedding and the property th
Embeddings of Un(q2) and symmetric strongly regular graphs
β Scribed by Antonio Cossidente
- Publisher
- John Wiley and Sons
- Year
- 2009
- Tongue
- English
- Weight
- 101 KB
- Volume
- 18
- Category
- Article
- ISSN
- 1063-8539
No coin nor oath required. For personal study only.
β¦ Synopsis
Abstract
In the geometric setting of the embedding of the unitary group U~n~(q^2^) inside an orthogonal or a symplectic group over the subfield GF(q) of GF(q^2^), q odd, we show the existence of infinite families of transitive twoβcharacter sets with respect to hyperplanes that in turn define new symmetric strongly regular graphs and twoβweight codes. Β© 2009 Wiley Periodicals, Inc. J Combin Designs 18: 248β253, 2010
π SIMILAR VOLUMES
## Abstract In this paper, it will be shown that the isomorphism classes of regular orientable embeddings of the complete bipartite graph __K__~__n,n__~ are in oneβtoβone correspondence with the permutations on __n__ elements satisfying a given criterion, and the isomorphism classes of them are com
## Abstract We apply symmetric balanced generalized weighing matrices with zero diagonal to construct four parametrically new infinite families of strongly regular graphs. Β© 2003 Wiley Periodicals, Inc. J Combin Designs 11: 208β217, 2003; Published online in Wiley InterScience (www.interscience.wil