Commuting Graphs, C(G, X) in Symmetric Groups Sym(n) and Its Connectivity

Autor:	Sharifah Kartini Said Husain, Athirah Nawawi, Muhammad Rezal Kamel Ariffin
Rok vydání:	2019
Předmět:	Physics commuting graph Physics and Astronomy (miscellaneous) lcsh:Mathematics General Mathematics 010102 general mathematics 0102 computer and information sciences lcsh:QA1-939 01 natural sciences Graph symmetric group Combinatorics TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES Conjugacy class 010201 computation theory & mathematics Chemistry (miscellaneous) Symmetric group Computer Science (miscellaneous) 0101 mathematics Commutative property order 3 elements
Zdroj:	Symmetry Volume 11 Issue 9 Symmetry, Vol 11, Iss 9, p 1178 (2019)
ISSN:	2073-8994
Popis:	A commuting graph is a graph denoted by C ( G , X ) where G is any group and X, a subset of a group G, is a set of vertices for C ( G , X ) . Two distinct vertices, x , y &isin X , will be connected by an edge if the commutativity property is satisfied or x y = y x . This study presents results for the connectivity of C ( G , X ) when G is a symmetric group of degree n, Sym ( n ) , and X is a conjugacy class of elements of order three in G.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_dedup___::99cb79448e77952cffdb827f27784f76 https://doi.org/10.3390/sym11091178 Zobrazit plný text záznamu Plný text ve formátu PDF Plný text ve formátu HTML
Nepřihlášeným uživatelům se plný text nezobrazuje	K zobrazení výsledku je třeba se přihlásit.