The Square element graph over a semigroup S is a simple undirected graph S q ( S ) whose vertex set consists precisely of all the non-zero elements of S , and two vertices a , b are adjacent if and only if either a b or b a belongs to the set { t 2 : t ∈ S } ∖ { 1 } , where 1 is the identity of the semigroup (if it ...
Jun 9, 2020
Jun 9, 2020 · In this paper, we study the various properties of S q ( S ) . In particular, we concentrate on square element graphs over three important classes of semigroups.
Feb 21, 2019 · The Square element graph over a semigroup is a simple undirected graph whose vertex set consists precisely of all the non-zero elements.
The Square element graph over a semigroup S is a simple undirected graph Sq(S) whose vertex set consists precisely of all the non-zero elements of S, and two ...
Jun 9, 2020 · First, we consider the semigroup Ω n formed by the ideals of Z n. Afterwards, we consider the symmetric groups S n and the dihedral groups D n.
The Square element graph over a semigroup S is a simple undirected graph Sq(S) whose vertex set consists precisely of all the non-zero elements of S, ...
Sen, S. Kar, Some properties of square element graphs over semigroups, AKCE International Journal of Graphs and Combinatorics, To Ap-pear. [4] F.
Some properties of square element graphs over semigroups. B Biswas, R Sen Gupta, MK Sen, S Kar. AKCE International Journal of Graphs and Combinatorics 17 (1) ...
Some properties of Square element graphs over semigroups · Sukhendu Kar. AKCE ... the structural and other graph-theoretic properties of the corresponding square ...