Nalazite se na CroRIS probnoj okolini. Ovdje evidentirani podaci neće biti pohranjeni u Informacijskom sustavu znanosti RH. Ako je ovo greška, CroRIS produkcijskoj okolini moguće je pristupi putem poveznice www.croris.hr
izvor podataka: crosbi

Enumeration of symmetric (45,12,3) designs with nontrivial automorphisms (CROSBI ID 244439)

Prilog u časopisu | izvorni znanstveni rad | međunarodna recenzija

Crnković, Dean ; Dumičić Danilović, Doris ; Rukavina, Sanja Enumeration of symmetric (45,12,3) designs with nontrivial automorphisms // Journal of algebra combinatorics discrete structures and applications, 3 (2016), 3; 145-154. doi: 10.13069/jacodesmath.29560

Podaci o odgovornosti

Crnković, Dean ; Dumičić Danilović, Doris ; Rukavina, Sanja

engleski

Enumeration of symmetric (45,12,3) designs with nontrivial automorphisms

We show that there are exactly 4285 symmetric (45, 12, 3) designs that admit nontrivial automorphisms. Among them there are 1161 self- dual designs and 1562 pairs of mutually dual designs. We describe the full automorphism groups of these designs and analyze their ternary codes. R. Mathon and E. Spence have constructed 1136 symmetric (45, 12, 3) designs with trivial automorphism group, which means that there are at least 5421 symmetric (45, 12, 3) designs. Further, we discuss trigeodetic graphs obtained from the symmetric (45, 12, 3) designs. We prove that k-geodetic graphs constructed from mutually non- isomorphic designs are mutually non-isomorphic, hence there are at least 5421 mutually non-isomorphic trigeodetic graphs obtained from symmetric (45, 12, 3) designs.

symmetric design ; linear code ; automorphism group ; k-geodetic graph

nije evidentirano

nije evidentirano

nije evidentirano

nije evidentirano

nije evidentirano

nije evidentirano

Podaci o izdanju

3 (3)

2016.

145-154

objavljeno

2148-838X

10.13069/jacodesmath.29560

Povezanost rada

Matematika

Poveznice