A finite nonabelian simple group is called a simple Kn–group, if the order of G has

exactly n distinct prime factors. M. Herzog and W.J. Shi gave a characterization

of simple Kn–group for n = 3, 4, respectively. ...

Let G be a finite group. A well-known result of W. Burnside

tells us that, for any nonlinear irreducible character χ of G, there exists

an element g ∈ G such that χ(g) = 0. In this paper, first we investigate ...

A finite group G is called an M-group, if all its complex irreducible

characters are monomial; that is, they are induced by a linear

character of a subgroup of G. It is known that a quotient of an ...

The commuting graph of a group G, denoted by \\\\\\\\Gamma(G), is a simple graph whose vertices are all non-central elements of G and two distinct vertices x,y are adjacent if xy=yx.

‎Consider an $m\\times n$ table $T$ and latices paths $\\nu_1,\\ldots,\\nu_k$ in $T$ such that each step $\\nu_{i+1}-\\nu_i=(1,1)$‎, ‎$(1,0)$ or $(1,-1)$‎. ‎The number of paths from the $(1,i)$-cell (resp‎. ‎first column) ...

The commuting graph of a group G, denoted by Γ( G ), is a

simple graph whose vertices are all non-central elements of G and two distinct vertices x, y are adjacent if xy = yx . It is conjectured that if M

is ...

The commuting graph of a group G, denote d by Γ( G), is a simple

undirected graph whose vertices are all non-central elements of G and two

distinct vertices x, y are adjacent if xy = y x. The commuting graph ...

در این مقاله، درجه جابه جایی تانسوری یک زوج از گروههای متناهی را مورد بررسی قرار دادهایم. با توجه به این که درجه جابه جایی نسبی توسط Erdos معرفی شده و خواص آن مورد بررسی قرار گرفته است، بعد از آن آقای دکتر نیرومند به معرفی ...

In this paper, we define and study the cyclic graph Γ_S of a finite semigroup S. We obtain

some graph theoretical properties of Γ_S including its dominating number, independence

number and genus of the graph. ...