𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An infinite family of self-diclique digraphs

✍ Scribed by Ana Paulina Figueroa; Bernardo Llano

Publisher
Elsevier Science
Year
2010
Tongue
English
Weight
252 KB
Volume
23
Category
Article
ISSN
0893-9659

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An infinite family of integral graphs
An infinite family of integral graphs
✍ Moshe Roitman πŸ“‚ Article πŸ“… 1984 πŸ› Elsevier Science 🌐 English βš– 272 KB

We obtain here an infinite family of integral complete tripartite grapbs. The 'purpose-of this note is to obtain an infinite family of integral mmpjete tripartite graphs. For background see [l]. We recall first some detitions and facts. A complete n-pu\*te gnzph K(p\*, l . l 5 p,,) is a graph with a

An infinite family of symmetric designs
An infinite family of symmetric designs
✍ Christopher J. Mitchell πŸ“‚ Article πŸ“… 1979 πŸ› Elsevier Science 🌐 English βš– 363 KB

In this paper, using the construction method of [3], we show that if q > 2 is a prime power such that there exists an afhne plane of order q -1, then there exists a strongly divisible 2 -((q -l)(qh -l), qh-'(q -l), qh-') design for every h 2 2. We show that these quasi-residual designs are embeddabl

An infinite family of biprimitive semisy
An infinite family of biprimitive semisymmetric graphs
✍ Du, Shao-Fei; Maru??i??, Dragan πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 296 KB πŸ‘ 1 views

A regular and edge-transitive graph that is not vertex-transitive is said to be semisymmetric. Every semisymmetric graph is necessarily bipartite, with the two parts having equal size and the automorphism group acting transitively on each of these two parts. A semisymmetric graph is called biprimiti

An infinite family of (simple) 6-designs
An infinite family of (simple) 6-designs
✍ Donald L. Kreher πŸ“‚ Article πŸ“… 1993 πŸ› John Wiley and Sons 🌐 English βš– 193 KB πŸ‘ 1 views

A simple 6-(22,8,60) designs is exhibited. It is then shown using Qui-rong Wu's generalization of a result of Luc Teirlinck that this design together with our 6-(14,7,4) design implies the existence of simple 6-(23 + 16m,8,4(m + I) (16m + 17)) designs for all positive integers m. All the above ment