Displaying similar documents to “One-factorizations of regular graphs of order 12.”

Properties of the Steiner triple systems of order 19.

Colbourn, Charles J., Forbes, Anthony D., Grannell, Mike J., Griggs, Terry S., Kaski, Petteri, Östergård, Patric R.J., Pike, David A., Pottonen, Olli (2010)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

On Graph-Based Cryptography and Symbolic Computations

V. A., Ustimenko (2007)

Serdica Journal of Computing

Similarity:

We have been investigating the cryptographical properties of in nite families of simple graphs of large girth with the special colouring of vertices during the last 10 years. Such families can be used for the development of cryptographical algorithms (on symmetric or public key modes) and turbocodes in error correction theory. Only few families of simple graphs of large unbounded girth and arbitrarily large degree are known. The paper is devoted to the more general theory of directed...

Codes and designs from triangular graphs and their line graphs

Washiela Fish, Khumbo Kumwenda, Eric Mwambene (2011)

Open Mathematics

Similarity:

For any prime p, we consider p-ary linear codes obtained from the span over 𝔽 p p of rows of incidence matrices of triangular graphs, differences of the rows and adjacency matrices of line graphs of triangular graphs. We determine parameters of the codes, minimum words and automorphism groups. We also show that the codes can be used for full permutation decoding.