Commuting Involution Graphs for Certain Exceptional Groups of Lie Type
نویسندگان
چکیده
Abstract Suppose that G is a finite group and X -conjugacy classes of involutions. The commuting involution graph $${\mathcal {C}}(G,X)$$ C ( G , X ) the whose vertex set with $$x, y \in X$$ x y ∈ being joined if $$x \ne y$$ ≠ $$xy = yx$$ = . Here for various exceptional Lie type groups characteristic two we investigate their graphs.
منابع مشابه
commuting and non -commuting graphs of finit groups
فرض کنیمg یک گروه غیر آبلی متناهی باشد . گراف جابجایی g که با نماد نمایش داده می شود ،گرافی است ساده با مجموعه رئوس که در آن دو راس با یک یال به هم وصل می شوند اگر و تنها اگر . مکمل گراف جابجایی g راگراف نا جابجایی g می نامیم.و با نماد نشان می دهیم. گرافهای جابجایی و ناجابجایی یک گروه متناهی ،اولین بار توسطاردوش1 مطرح گردید ،ولی در سالهای اخیر به طور مفصل در مورد بحث و بررسی قرار گرفتند . در ،م...
15 صفحه اولCommuting Involution Graphs for 3-Dimensional Unitary Groups
For a group G and X a subset of G the commuting graph of G on X, denoted by C(G,X), is the graph whose vertex set is X with x, y ∈ X joined by an edge if x 6= y and x and y commute. If the elements in X are involutions, then C(G,X) is called a commuting involution graph. This paper studies C(G,X) when G is a 3-dimensional projective special unitary group and X a G-conjugacy class of involutions...
متن کاملCommuting Involution Graphs for Ãn
Let G be a group and X a subset of G. The commuting graph on X, denoted C(G,X), has vertex set X and an edge joining x, y ∈ X whenever xy = yx. If in addition X is a set of involutions, then C(G,X) is called a commuting involution graph. Commuting graphs have been investigated by many authors. Sometimes they are tools used in the proof of a theorem, or they may be studied as a way of shedding l...
متن کاملBlack Box Exceptional Groups of Lie Type
If a black box group is known to be isomorphic to an exceptional simple group of Lie type of (twisted) rank > 1, other than any F4(q), over a field of known size, a Las Vegas algorithm is given to produce a constructive isomorphism. In view of its timing, this algorithm yields an upgrade of all known nearly linear time Monte Carlo permutation group algorithms to Las Vegas algorithms when the in...
متن کاملMatrix Generators for Exceptional Groups of Lie Type
Until recently it was impractical to use general purpose computer algebra systems to investigate Chevalley groups except for those of small rank over small fields. But computer algebra systems (such as Magma (Bosma et al. 1997) and GAP (Schönert et al. 1994)) now have the power to deal with some aspects of all finite groups of Lie type. A natural way to represent these groups is via matrices ov...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Graphs and Combinatorics
سال: 2021
ISSN: ['1435-5914', '0911-0119']
DOI: https://doi.org/10.1007/s00373-021-02321-w