On Pi-Product Involution Graphs in Symmetric Groups
نویسندگان
چکیده
Suppose that G is a group, X a subset of G and π a set of natural numbers. The π-product graph Pπ(G,X) has X as its vertex set and distinct vertices are joined by an edge if the order of their product is in π. If X is a set of involutions, then Pπ(G,X) is called a π-product involution graph. In this paper we study the connectivity and diameters of Pπ(G,X) when G is a finite symmetric group and X is a G-conjugacy class of involutions.
منابع مشابه
On π-Product Involution Graphs in Symmetric Groups
Suppose that G is a group, X a subset of G and π a set of natural numbers. The π-product graph Pπ(G,X) has X as its vertex set and distinct vertices are joined by an edge if the order of their product is in π. If X is a set of involutions, then Pπ(G,X) is called a π-product involution graph. In this paper we study the connectivity and diameters of Pπ(G,X) when G is a finite symmetric group and ...
متن کاملComputing PI and Hyper–Wiener Indices of Corona Product of some Graphs
Let G and H be two graphs. The corona product G o H is obtained by taking one copy of G and |V(G)| copies of H; and by joining each vertex of the i-th copy of H to the i-th vertex of G, i = 1, 2, …, |V(G)|. In this paper, we compute PI and hyper–Wiener indices of the corona product of graphs.
متن کاملA NOTE ON THE COMMUTING GRAPHS OF A CONJUGACY CLASS IN SYMMETRIC GROUPS
The commuting graph of a group is a graph with vertexes set of a subset of a group and two element are adjacent if they commute. The aim of this paper is to obtain the automorphism group of the commuting graph of a conjugacy class in the symmetric groups. The clique number, coloring number, independent number, and diameter of these graphs are also computed.
متن کامل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...
متن کاملCubic symmetric graphs of orders $36p$ and $36p^{2}$
A graph is textit{symmetric}, if its automorphism group is transitive on the set of its arcs. In this paper, we classifyall the connected cubic symmetric graphs of order $36p$ and $36p^{2}$, for each prime $p$, of which the proof depends on the classification of finite simple groups.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017