✦ LIBER ✦

A new two-weight code and strongly regular graph

✍ Scribed by T.A. Gulliver

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 209 KB
Volume: 9
Category: Article
ISSN: 0893-9659
DOI: 10.1016/0893-9659(96)00004-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Two new optimal ternary two-weight codes

Two new optimal ternary two-weight codes and strongly regular graphs

✍ T.Aaron Gulliver 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 424 KB

It is well known that two-weight codes result in strongly regular graphs if the code is projective. In this paper optimal (84,6,54) and (98,6,63) quasi-cyclic two-weight codes over GF(3) are presented. These codes were constructed using heuristic optimization with a local search, a technique which h

A new strongly regular graph

✍ Rudolf Mathon; Alexander Rosa 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 113 KB

A Block Negacyclic Bush-Type Hadamard Ma

A Block Negacyclic Bush-Type Hadamard Matrix and Two Strongly Regular Graphs

✍ Zvonimir Janko; Hadi Kharaghani 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 84 KB

A block negacyclic Bush-type Hadamard matrix of order 36 is used in a symmetric BGW (26, 25, 24) with zero diagonal over a cyclic group of order 12 to construct a twin strongly regular graph with parameters v=936, k=375, l=m=150 whose points can be partitioned in 26 cocliques of size 36. The same Ha

Deza graphs: A generalization of strongl

Deza graphs: A generalization of strongly regular graph

✍ M. Erickson; S. Fernando; W. H. Haemers; D. Hardy; J. Hemmeter 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 139 KB 👁 2 views

A new infinite series of regular uniform

A new infinite series of regular uniformly geodetic code graphs

✍ A.E. Brouwer; J.H. Koolen 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 481 KB

We construct vertex-transitive graphs r, regular of valency k = n\* + n + 1 on Y =2(y) vertices, with integral spectrum, possessing a distinguished complete matching such that contracting the edges of this matching yields the Johnson graph J(2n, n) (of valency n'). These graphs are uniformly geodeti

Strongly edge triangle regular graphs an

Strongly edge triangle regular graphs and a conjecture of Kotzig

✍ B.Radhakrishnan Nair; A. Vijayakumar 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 513 KB

The concepts of strongly vertex triangle regular graphs and strongly edge triangle regular graphs are introduced. An expression for the triangle number of a vertex in the composition of two graphs is obtained. It is proved that a self-complementary graph is strongly regular if and only if it is stro