Let g be a fixed element of a finite group G. We introduce the g-noncommuting graph of G whose vertex set is whole elements of the group G and two vertices x,y are adjacent whenever [x,y] g  and  [y,x] g. We denote this graph by . In this paper, we present some graph theoretical properties of g-noncommuting graph. Specially, we investigate about its planarity and regularity, its clique number a...

‎In a recent paper C‎. ‎Miguel proved that the diameter of the commuting graph of the matrix ring $mathrm{M}_n(mathbb{R})$ is equal to $4$ if either $n=3$ or $ngeq5$‎. ‎But the case $n=4$ remained open‎, ‎since the diameter could be $4$ or $5$‎. ‎In this work we close the problem showing that also in this case the diameter is $4$.

‎The distinguishing number (resp. index) $D(G)$ ($D'(G)$) of a graph $G$ is the least integer $d$‎ ‎such that $G$ has an vertex labeling (resp. edge labeling) with $d$ labels that is preserved only by a trivial‎ ‎automorphism‎. ‎For any $n in mathbb{N}$‎, ‎the $n$-subdivision of $G$ is a simple graph $G^{frac{1}{n}}$ which is constructed by replacing each edge of $G$ with a path of length $n$...

A comprehensive graph theoretical and finite geometrical study of the commutation relations between the generalized Pauli operators of N -qudits is performed in which vertices/points correspond to the operators and edges/lines join commuting pairs of them. As per two-qubits, all basic properties and partitionings of the corresponding Pauli graph are embodied in the geometry of the generalized q...

Let D be a division ring, n 2 a natural number, and C ⊆ Mn(D). Two matrices A and B are called C−commuting if there is C ∈ C that AB−BA = C. In this paper the C−commuting graph of Mn(D) is defined and denoted by ΓC(Mn(D)). Conditions are given that guarantee that the C−commuting graph is connected.

Let D be a division ring, n 2 a natural number, and C ⊆ Mn(D). Two matrices A and B are called C−commuting if there is C ∈ C that AB−BA = C. In this paper the C−commuting graph of Mn(D) is defined and denoted by ΓC(Mn(D)). Conditions are given that guarantee that the C−commuting graph is connected.

A comprehensive graph theoretical and finite geometrical study of the commutation relations between the generalized Pauli operators of N -qudits is performed in which vertices/points correspond to the operators and edges/lines join commuting pairs of them. As per two-qubits, all basic properties and partitionings of the corresponding Pauli graph are embodied in the geometry of the generalized q...

We present a two-parameter family (Gm,k)m,k∈N≥2 , of finite, non-abelian random groups and propose that, for each fixed k, as m → ∞ the commuting graph of Gm,k is almost surely connected and of diameter k. We present heuristic arguments in favour of this conjecture, following the lines of classical arguments for the Erdős– Rényi random graph. As well as being of independent interest, our groups...