Properties of tiny braids and the associated commuting graph
Sign Up to like & getrecommendations! Published in 2019 at "Journal of Algebraic Combinatorics"
DOI: 10.1007/s10801-019-00923-5
Abstract: In this text, we focus on a subset (called the set of tiny braids) of factors of the Garside braid and generalize some known results related to tiny braids. These generalized results, along with some… read more here.
Keywords: properties tiny; associated commuting; braids associated; commuting graph ... See more keywords
EXTENDING RESULTS OF MORGAN AND PARKER ABOUT COMMUTING GRAPHS
Sign Up to like & getrecommendations! Published in 2021 at "Bulletin of the Australian Mathematical Society"
DOI: 10.1017/s0004972721000332
Abstract: Abstract Morgan and Parker proved that if G is a group with ${\textbf{Z}(G)} = 1$ , then the connected components of the commuting graph of G have diameter at most $10$ . Parker proved that… read more here.
Keywords: morgan parker; commuting graph; parker; group ... See more keywords
On the non-commuting graph in finite Moufang loops
Sign Up to like & getrecommendations! Published in 2017 at "Journal of Algebra and Its Applications"
DOI: 10.1142/s0219498818500706
Abstract: The non-commuting graph associated to a non-abelian group G, ΓG, is a graph with vertex set G∖Z(G) where distinct non-central elements x and y of G are joined by an edge if and only if… read more here.
Keywords: moufang loops; commuting graph; non abelian; non commuting ... See more keywords
On Diameter of Subgraphs of Commuting Graph in Symplectic Group for Elements of Order Three
Sign Up to like & getrecommendations! Published in 2021 at "Sains Malaysiana"
DOI: 10.17576/jsm-2021-5002-25
Abstract: Suppose G be a finite group and X be a subset of G. The commuting graph, denoted by C(G,X), is a simple undirected graph, where X ⊂G being the set of vertex and two distinct… read more here.
Keywords: order three; symplectic group; commuting graph; elements order ... See more keywords