On the Hall-Janko graph with 100 vertices and the near-octagon of order (2, 4)
نویسندگان
چکیده
In this paper, we construct the Hall-Janko graph within the split Cayley hexagon H(4). Using this graph we then construct the near-octagon of order (2, 4) as a subgeometry of the dual of H(4), with J2 : 2 as its automorphism group. These constructions are based on a lemma determining the possibilities for the structure of the intersection of two subhexagons of order 2 in H(4).
منابع مشابه
A New Near Octagon and the Suzuki Tower
We construct and study a new near octagon of order (2, 10) which has its full automorphism group isomorphic to the group G2(4) : 2 and which contains 416 copies of the Hall-Janko near octagon as full subgeometries. Using this near octagon and its substructures we give geometric constructions of the G2(4)-graph and the Suzuki graph, both of which are strongly regular graphs contained in the Suzu...
متن کاملA note on the order graph of a group
The order graph of a group $G$, denoted by $Gamma^*(G)$, is a graph whose vertices are subgroups of $G$ and two distinct vertices $H$ and $K$ are adjacent if and only if $|H|big{|}|K|$ or $|K|big{|}|H|$. In this paper, we study the connectivity and diameter of this graph. Also we give a relation between the order graph and prime graph of a group.
متن کاملOctagon Quadrangle Systems nesting 4-kite-designs having equi-indices
An octagon quadrangle is the graph consisting of an 8-cycle (x1, ..., x8) with two additional chords: the edges {x1, x4} and {x5, x8}. An octagon quadrangle system of order v and index λ [OQS] is a pair (X,B), where X is a finite set of v vertices and B is a collection of edge disjoint octagon quadrangles (called blocks) which partition the edge set of λKv defined on X. A 4-kite is the graph ha...
متن کاملQuasirecognition by the prime graph of L_3(q) where 3 < q < 100
Let $G$ be a finite group. We construct the prime graph of $ G $,which is denoted by $ Gamma(G) $ as follows: the vertex set of thisgraph is the prime divisors of $ |G| $ and two distinct vertices $ p$ and $ q $ are joined by an edge if and only if $ G $ contains anelement of order $ pq $.In this paper, we determine finite groups $ G $ with $ Gamma(G) =Gamma(L_3(q)) $, $2 leq q < 100 $ and prov...
متن کاملMatching Integral Graphs of Small Order
In this paper, we study matching integral graphs of small order. A graph is called matching integral if the zeros of its matching polynomial are all integers. Matching integral graphs were first studied by Akbari, Khalashi, etc. They characterized all traceable graphs which are matching integral. They studied matching integral regular graphs. Furthermore, it has been shown that there is no matc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Contributions to Discrete Mathematics
دوره 4 شماره
صفحات -
تاریخ انتشار 2009