✦ LIBER ✦

Automorphism free latin square graphs

✍ Scribed by K.T. Phelps

Publisher: Elsevier Science
Year: 1980
Tongue: English
Weight: 837 KB
Volume: 31
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(80)90036-9

No coin nor oath required. For personal study only.

✦ Synopsis

In this paper, we show that there exists an automorphism free latin square graph of order n for all n a 7 and that the number of such graphs goes to infinity with n. These results are then applied to the construction of automorphism free Steiner triple systems.

📜 SIMILAR VOLUMES

Near-automorphisms of Latin squares

✍ Nicholas J. Cavenagh; Douglas S. Stones 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 560 KB

We define a near-automorphism a of a Latin square L to be an isomorphism such that L and aL differ only within a 2×2 subsquare. We prove that for all n ≥ 2 except n ∈{3, 4}, there exists a Latin square which exhibits a near-automorphism. We also show that if a has the cycle structure (2, n-2), then

Orthogonal latin square graphs

✍ Charles C. Lindner; E. Mendelsohn; N. S. Mendelsohn; Barry Wolk 📂 Article 📅 1979 🏛 John Wiley and Sons 🌐 English ⚖ 617 KB

## Abstract An orthogonal latin square graph (OLSG) is one in which the vertices are latin squares of the same order and on the same symbols, and two vertices are adjacent if and only if the latin squares are orthogonal. If __G__ is an arbitrary finite graph, we say that __G__ is realizable as an O

Representations of graphs and orthogonal

Representations of graphs and orthogonal latin square graphs

✍ Paul Erdös; Anthony B. Evans 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 155 KB

A latin square with orthogonal mate and

A latin square with orthogonal mate and no automorphism

✍ E.T Parker 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 65 KB

On a class of square-free graphs

✍ Xue Qingbo 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 171 KB

Strongly Regular Square-free Graphs with

Strongly Regular Square-free Graphs with μ=2

✍ Benjamin V.C. Collins 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 277 KB

By a square in an undirected graph ⌫ , we mean a cycle x , y , z , w such that x is not adjacent to z and y is not adjacent to w . Suppose that ⌫ is a strongly regular graph with ϭ 2 , and assume that ⌫ does not contain a square . Pick any vertex x of ⌫ and let ⌫ Ј denote the induced subgraph on the