We find a natural construction of a large class of symmetric graphs from point-and block-transitive 1-designs. The graphs in this class can be characterized as G-symmetric graphs whose vertex sets admit a G-invariant partition B of block size at least 3 such that, for any two blocks B, C of B, eithe
β¦ LIBER β¦
Construction of a class of loops via graphs
β Scribed by Elena Zizioli
- Book ID
- 105761450
- Publisher
- Springer
- Year
- 2009
- Tongue
- English
- Weight
- 204 KB
- Volume
- 95
- Category
- Article
- ISSN
- 0047-2468
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Constructing a Class of Symmetric Graphs
β
Sanming Zhou
π
Article
π
2002
π
Elsevier Science
π
English
β 208 KB
Construction of a certain class of line
β
M. D. Bachurina; I. A. Skobelina
π
Article
π
1992
π
Springer US
π
English
β 494 KB
Mutation classes of diagrams via infinit
β
Thilo Henrich
π
Article
π
2011
π
John Wiley and Sons
π
English
β 260 KB
π 1 views
## Abstract We give a complete description of the clusterβmutation classes of diagrams of Dynkin types \documentclass{article}\usepackage{amssymb}\begin{document}\pagestyle{empty}$\mathbb {A},\mathbb {B},\mathbb {D}$\end{document} and of affine Dynkin types \documentclass{article}\usepackage{amssym
Direct construction of code loops
β
GΓ‘bor P. Nagy
π
Article
π
2008
π
Elsevier Science
π
English
β 302 KB
A class of simple proper Bol loops
β
GΓ‘bor P. Nagy
π
Article
π
2008
π
Springer
π
English
β 138 KB
Classification of a class of distance-re
β
Josep RifΓ ; L. Huguet
π
Article
π
1990
π
Elsevier Science
π
English
β 699 KB