✦ LIBER ✦

On Hadamard tournaments

✍ Scribed by Noboru Ito

Publisher: Elsevier Science
Year: 1990
Tongue: English
Weight: 493 KB
Volume: 131
Category: Article
ISSN: 0021-8693
DOI: 10.1016/0021-8693(90)90184-p

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Even tournaments and Hadamard tournament

Even tournaments and Hadamard tournaments

✍ Noboru Ito 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 309 KB

We discuss several tournaments. results and problems of even tournaments and Hadamard

Doubly regular tournaments are equivalen

Doubly regular tournaments are equivalent to skew hadamard matrices

✍ K.B Reid; Ezra Brown 📂 Article 📅 1972 🏛 Elsevier Science 🌐 English ⚖ 314 KB

On Hadamard Groups

✍ N. Ito 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 267 KB

On arc-traceable tournaments

✍ Arthur H. Busch; Michael S. Jacobson; K. B. Reid 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 129 KB

## Abstract A digraph __D__ = (__V__, __A__) is arc‐traceable if for each arc __xy__ in __A__, __xy__ lies on a directed path containing all the vertices of __V__, that is, a hamiltonian path. Given a tournament __T__, it is well known that it contains a directed hamiltonian path. In this article,

Embedding tournaments in simple tourname

Embedding tournaments in simple tournaments

✍ J.W. Moon 📂 Article 📅 1972 🏛 Elsevier Science 🌐 English ⚖ 693 KB

A tournament is simple if the corresp(!nding reEationa1 system is simple in the alge brnlc ~nse. it ir sh~un that cony F~~utnmlent T,, with IT nodes can be embedded in in simple tourrramant r \*+ 1 apart from two exceptional types of tournaments which can be embeddecl rn a %impie Fournczmtn t TR+ 1.

On Generalized Hadamard Subsets

✍ Noboru Ito; Pan Soo Kim 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 92 KB

We introduce the concept of generalized Hadamard subsets. Some basic results on them are presented here.