Results 1 to 10 of about 2,330 (164)
On the Commuting Graph of Semidihedral Group [PDF]
The commuting graph $Δ(G)$ of a finite non-abelian group $G$ is a simple graph with vertex set $G$ and two distinct vertices $x, y$ are adjacent if $xy = yx$. In this paper, among some properties of $Δ(G)$, we investigate $Δ(SD_{8n})$ the commuting graph of the semidihedral group $SD_{8n}$.
Jitender Kumar +2 more
exaly +4 more sources
On the non-commuting graph of dihedral group [PDF]
For a nonabelian group G, the non-commuting graph Γ of G is defined as the graph with vertex-set G-Z(G), where Z(G) is the center of G, and two distinct vertices of Γ are adjacent if they do not commute in G.
Sanhan Muhammad Salih Khasraw +2 more
doaj +4 more sources
Non-commuting graph of a group
The non-commuting graph \(\Gamma_G\) of a non-Abelian group \(G\) is defined as follows. The vertex set of \(\Gamma_G\) is \(V(G)=G-Z(G)\) and two vertices \(x\) and \(y\) are joined by an edge if and only if \(xy\neq yx\). This graph was first defined by P. Erdős which is quoted by \textit{B. H. Neumann} [J. Aust. Math. Soc., Ser. A 21, 467-472 (1976;
Alireza Abdollahi, Saieed Akbari
exaly +3 more sources
Accurately estimating commuting flow is essential for optimizing urban planning and traffic design. The latest graph neural network (GNN) model with the encoder-decoder-predictor components has several limitations.
Qingli Shi +3 more
doaj +3 more sources
Commuting conjugacy classes graph of the generalized dihedral and dicyclic groups [PDF]
Suppose $G$ is a finite non-abelian group and $\Gamma(G)$ is a simple graph with the non-central conjugacy classes of $G$ as its vertex set. Two different non-central conjugacy classes $A$ and $B$ are assumed to be adjacent if and only if there are ...
Mohammadali Salahshour
doaj +1 more source
Graphs of commutatively closed sets [PDF]
The present work aims to exploit the interplay between the algebraic properties of rings and the graph-theoretic structures of their associated graphs. We introduce commutatively closed graphs and investigate properties of commutatively closed subsets of a ring with the help of graph theory. A particular attention is paid to constructions of subsets of
Leroy, André, Abdi, Mona
openaire +2 more sources
Commuting Conjugacy Class Graph of G when G / Z(G)~=D2n [PDF]
Suppose G is a finite non-abelian group and Γ(G) is a simple graph with the non-central conjugacy classes of G as its vertex set. Two different noncentral conjugacy classes C and B are assumed to be adjacent in Γ(G) if and only if there are elements a ...
Mohammad Ali Salahshour
doaj +1 more source
Abstract Let 𝐴 be a finite group acting by automorphisms on the finite group 𝐺. We introduce the commuting graph Γ (
Guloglu, Ismail S., Ercan, Gulin
openaire +4 more sources
Some structural graph properties of the non-commuting graph of a class of finite Moufang loops
For any non-abelian group G, the non-commuting graph of G, Γ=ΓG, is a graph with vertex set G \ Z(G), where Z(G) is the set of elements of G that commute with every element of G and distinct non-central elements x and y of G are joined by an edge if and ...
Hamideh Hasanzadeh Bashir +1 more
doaj +1 more source
Spectral properties of the commuting graphs of certain groups
Let G be a finite group. The commuting graph Γ=C(G)is a simple graph with vertex set G and two vertices are adjacent if and only if they commute with each other.
M. Torktaz, A.R. Ashrafi
doaj +2 more sources

