Hall–Janko graph

Hall–Janko graph

[

HJ as Foster graph (90 outer vertices) plus Steiner system S(3,4,10) (10 inner vertices).]

In graph theory, the Hall–Janko graph, also known as the Hall-Janko-Wales graph, is a rank 3 strongly regular graph with parameters (100,36,14,12) and a maximum coclique of size 10. This parameter set is not unique, it is however uniquely determined by its parameters as a rank 3 graph. The Hall-Janko graph was originally constructed by D. Wales to establish the existence of the Hall-Janko group as an index 2 subgroup of its automorphism group.

The Hall-Janko graph can be constructed out of objects in U3(3), the simple group of order 6048:
* In U3(3) there are 36 simple maximal subgroups of order 168. These are the vertices of a subgraph, the U3(3) graph. A 168-subgroup has 14 maximal subgroups of order 24, isomorphic to S4. Two 168-subgroups are called adjacent when they intersect in a 24-subgroup. The U3(3) graph is strongly regular, with parameters (36,14,4,6)
* There are 63 involutions (elements of order 2). A 168-subgroup contains 21 involutions, which are defined to be neighbors.
* Outside U3(3) let there be a 100th vertex C, whose neighbors are the 36 168-subgroups. A 168-subgroup then has 14 common neighbors with C and in all 1+14+21 neighbors.
* An involution is found in 12 of the 168-subgroups. C and an involution are non-adjacent, with 12 common neighbors.
* Two involutions are defined as adjacent when they are shared by 4 168-subgroups. An involution has 24 involutions as neighbors.

References

* [http://www.win.tue.nl/~aeb/drg/graphs/HallJanko.html Hall-Janko graph]
* [http://www.win.tue.nl/~aeb/drg/graphs/U3_3.html U3(3) graph]


Wikimedia Foundation. 2010.

Игры ⚽ Нужно решить контрольную?

Look at other dictionaries:

  • Hall–Janko group — In mathematics, the Hall Janko group HJ , is a finite simple sporadic group of order 604800. It is also called the second Janko group J 2, or the Hall Janko Wales group, since it was predicted by Janko and constructed by Hall and Wales. It is a… …   Wikipedia

  • Graphe de Hall-Janko — Représentation du graphe de Hall Janko Nombre de sommets 100 Nombre d arêtes 1800 Distribution des degrés 36 régulier Rayon …   Wikipédia en Français

  • List of mathematics articles (H) — NOTOC H H cobordism H derivative H index H infinity methods in control theory H relation H space H theorem H tree Haag s theorem Haagerup property Haaland equation Haar measure Haar wavelet Haboush s theorem Hackenbush Hadamard code Hadamard… …   Wikipedia

  • Conway group — Group theory Group theory …   Wikipedia

  • List of mathematical examples — This page will attempt to list examples in mathematics. To qualify for inclusion, an article should be about a mathematical object with a fair amount of concreteness. Usually a definition of an abstract concept, a theorem, or a proof would not be …   Wikipedia

  • Projet:Mathématiques/Liste des articles de mathématiques — Cette page n est plus mise à jour depuis l arrêt de DumZiBoT. Pour demander sa remise en service, faire une requête sur WP:RBOT Cette page recense les articles relatifs aux mathématiques, qui sont liés aux portails de mathématiques, géométrie ou… …   Wikipédia en Français

  • List of finite simple groups — In mathematics, the classification of finite simple groups states thatevery finite simple group is cyclic, or alternating, or in one of 16 families of groups of Lie type (including the Tits group, which strictly speaking is not of Lie type),or… …   Wikipedia

  • Higman–Sims group — In the mathematical field of group theory, the Higman–Sims group HS (named after Donald G. Higman and Charles C. Sims) is a finite group of order : 29 · 32 · 53 · 7 · 11: = 44352000.: ≈ 4 · 107.It is a simple group , meaning it does not have any… …   Wikipedia

  • Graphe intégral — En théorie des graphes, un graphe intégral est un graphe dont le spectre de la matrice d adjacence ne contient que des entiers[1]. En d autres termes, les racines de son polynôme caractéristiques sont toutes entières. Leur étude fut introduite… …   Wikipédia en Français

  • Group (mathematics) — This article covers basic notions. For advanced topics, see Group theory. The possible manipulations of this Rubik s Cube form a group. In mathematics, a group is an algebraic structure consisting of a set together with an operation that combines …   Wikipedia

Share the article and excerpts

Direct link
… Do a right-click on the link above
and select “Copy Link”