Relative g-noncommuting graph of finite groups

Abstract: Let

G

be a finite group. For a fixed element

g

in

G

and a given subgroup

H

of

G

, the relative

g

-noncommuting graph of

G

is a simple undirected graph whose vertex set is

G

and two vertices

x

and

y

are adjacent if

x i n H

or

y i n H

and

[x, y] e q g, g^{- 1}

. We denote this graph by

G a m m a_{H, G}^{g}

. In this paper, we obtain computing formulae for degree of any vertex in

G a m m a_{H, G}^{g}

and characterize whether

G a m m a_{H, G}^{g}

is a tree, star graph, lollipop or a complete graph together with some properties of

G a m m a_{H, G}^{g}

involving isomorphism of graphs. We also present certain relations between the number of edges in

G a m m a_{H, G}^{g}

and certain generalized commuting probabilities of

G

which give some computing formulae for the number of edges in

G a m m a_{H, G}^{g}

. Finally, we conclude this paper by deriving some bounds for the number of edges in

G a m m a_{H, G}^{g}

.

Recommendations

Cites work

Cited in

(10)

This page was built for publication: Relative \(g\)-noncommuting graph of finite groups