In this article we introduce the notion of n-capable groups. It is shown that every group G admits a uniquely determined subgroup (〖Z^n)〗^* (G) which is a characteristic subgroup and lies in the n-centre subgroup of the group G. This is the smallest subgroup of G whose factor group is n-capable. Moreover, some properties of n-central extension will be studied.

in this article we introduce the notion of n-capable groups. it is shown that every group g admits a uniquely determined subgroup (〖z^n)〗^* (g) which is a characteristic subgroup and lies in the n-centre subgroup of the group g. this is the smallest subgroup of g whose factor group is n-capable. moreover, some properties of n-central extension will be studied.

Let (G;N) be a pair of groups. In this article, first we con-struct a relative central extension for the pair (G;N) such that specialtypes of covering pair of (G;N) are homomorphic image of it. Second, weshow that every perfect pair admits at least one covering pair. Finally,among extending some properties of perfect groups to perfect pairs, wecharacterize covering pairs of a perfect pair (G;N)...

in this work, we investigate the transfer of some homological properties from a ring $r$ to its amalgamated duplication along some ideal $i$ of $r$ $rbowtie i$, and then generate new and original families of rings with these properties.

We generalize the notion of Jacobson graphs into $n$-array columns called $n$-array Jacobson graphs and determine their connectivities and diameters. Also, we will study forbidden structures of these graphs and determine when an $n$-array Jacobson graph is planar, outer planar, projective, perfect or domination perfect.

Roussel and Rubio proved a lemma which is essential in the proof of the Strong Perfect Graph Theorem. We give a new short proof of the main case of this lemma. In this note, we also give a short proof of Hayward’s decomposition theorem for weakly chordal graphs, relying on a Roussel–Rubio-type lemma. We recall how Roussel–Rubio-type lemmas yield very short proofs of the existence of even pairs ...

We will extend Reed's Semi-Strong Perfect Graph Theorem by proving that unbreakable C 5-free graphs diierent from a C 6 and its complement have unique P 4-structure.