Preferred Language
Articles
/
bBYnn4oBVTCNdQwCY6Hx
Commuting Involution Graphs for Certain Exceptional Groups of Lie Type
...Show More Authors
Abstract<p>Suppose that <italic>G</italic> is a finite group and <italic>X</italic> is a <italic>G</italic>-conjugacy classes of involutions. The commuting involution graph <inline-formula><alternatives><tex-math>$${\mathcal {C}}(G,X)$$</tex-math><math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mrow> <mi>C</mi> <mo>(</mo> <mi>G</mi> <mo>,</mo> <mi>X</mi> <mo>)</mo> </mrow> </math></alternatives></inline-formula> is the graph whose vertex set is <italic>X</italic> with <inline-formula><alternatives><tex-math>$$x, y \in X$$</tex-math><math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mrow> <mi>x</mi> <mo>,</mo> <mi>y</mi> <mo>∈</mo> <mi>X</mi> </mrow> </math></alternatives></inline-formula> being joined if <inline-formula><alternatives><tex-math>$$x \ne y$$</tex-math><math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mrow> <mi>x</mi> <mo>≠</mo> <mi>y</mi> </mrow> </math></alternatives></inline-formula> and <inline-formula><alternatives><tex-math>$$xy = yx$$</tex-math><math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mrow> <mi>x</mi> <mi>y</mi> <mo>=</mo> <mi>y</mi> <mi>x</mi> </mrow> </math></alternatives></inline-formula>. Here for various exceptional Lie type groups of characteristic two we investigate their commuting involution graphs.</p>
Scopus Clarivate Crossref
View Publication
Publication Date
Thu Feb 17 2022
Journal Name
Journal Of Discrete Mathematical Sciences And Cryptography
Calculation for the groups
...Show More Authors

View Publication
Scopus (3)
Crossref (4)
Scopus Clarivate Crossref
Publication Date
Wed Aug 31 2022
Journal Name
Iraqi Journal Of Science
Generalized Commuting Mapping in Prime and Semiprime Rings
...Show More Authors

     Let R be an associative ring. The essential purpose of the present paper is to introduce the concept of generalized commuting mapping of R. Let U be a non-empty subset of R, a mapping   : R  R is called a generalized commuting mapping on U if there exist a mapping :R R such that =0, holds for all U. Some results concerning the new concept are presented.

View Publication Preview PDF
Scopus Crossref
Publication Date
Sun Jan 19 2025
Journal Name
Journal Of Baghdad College Of Dentistry
Effect of disinfectant agents on certain physical and mechanical properties of type IV dental stone
...Show More Authors

Background: Dental stone casts come into contact with impression materials and becomes susceptible to cross contamination from saliva and blood. This study was done to evaluate the physical and mechanical properties of dental stone type IV after treatments with various disinfecting agents and regimes (methods). Materials and Methods: Type IV dental stone and different types of disinfecting agents were used and divided into seven groups: G1: dental stone without disinfection (control group), G2: dental stone mixed with silver nitrate powder 0.5% , G3: dental stone mixed with silver nitrate powder 1%, G4: dental stone mixed with copper sulfate powder 0.5%, G5: dental stone mixed with copper sulfate powder 1% ,G6: dental stone immersed in prop

... Show More
View Publication Preview PDF
Publication Date
Wed Mar 01 2023
Journal Name
Baghdad Science Journal
Quotient Energy of Zero Divisor Graphs And Identity Graphs
...Show More Authors

Consider the (p,q) simple connected graph . The sum absolute values of the spectrum of quotient matrix of a graph  make up the graph's quotient energy. The objective of this study is to examine the quotient energy of identity graphs and zero-divisor graphs  of commutative rings using group theory, graph theory, and applications. In this study, the identity graphs  derived from the group  and a few classes of zero-divisor graphs  of the commutative ring R are examined.

View Publication Preview PDF
Scopus (2)
Crossref (1)
Scopus Clarivate Crossref
Publication Date
Fri Jan 20 2023
Journal Name
Ibn Al-haitham Journal For Pure And Applied Sciences
On Antimagic Labeling for Some Families of Graphs
...Show More Authors

Antimagic labeling of a graph  with  vertices and  edges is assigned the labels for its edges by some integers from the set , such that no two edges received the same label, and the weights of vertices of a graph  are pairwise distinct. Where the vertex-weights of a vertex  under this labeling is the sum of labels of all edges incident to this vertex, in this paper, we deal with the problem of finding vertex antimagic edge labeling for some special families of graphs called strong face graphs. We prove that vertex antimagic, edge labeling for strong face ladder graph , strong face wheel graph ,  strong face fan graph , strong face prism graph  and finally strong face friendship graph .

View Publication Preview PDF
Crossref
Publication Date
Thu Feb 17 2022
Journal Name
Journal Of Discrete Mathematical Sciences And Cryptography
Periodical split for the groups
...Show More Authors

View Publication
Scopus (3)
Crossref (2)
Scopus Clarivate Crossref
Publication Date
Sun Dec 29 2019
Journal Name
Iraqi Journal Of Science
On Lie Structure in Semiprime Inverse Semirings
...Show More Authors

In this paper we introduce the definition of  Lie ideal on inverse semiring and we generalize some results of Herstein about Lie structure of an associative rings to inverse semirings.

View Publication Preview PDF
Scopus (2)
Crossref (1)
Scopus Crossref
Publication Date
Sat Mar 04 2023
Journal Name
Baghdad Science Journal
Nordhaus-Gaddum Type Relations on Open Support Independence Number of Some Path Related Graphs Under Addition and Multiplication
...Show More Authors

In this paper, Nordhaus-Gaddum type relations on open support independence number of some derived graphs of path related graphs under addition and multiplication are studied.

View Publication Preview PDF
Scopus Clarivate Crossref
Publication Date
Sat Jun 27 2020
Journal Name
Iraqi Journal Of Science
Lower and Upper Bounds for Hyper-Zagreb Index of Graphs
...Show More Authors

The topological indices are functions on the graph that do not depend on the labeling of their vertices. They are used by chemists for studying the properties of chemical compounds.  Let  be a simple connected graph. The Hyper-Zagreb index of the graph ,  is defined as  ,where  and  are the degrees of vertex  and , respectively. In this paper, we study the Hyper-Zagreb index and give upper and lower bounds for .

View Publication Preview PDF
Scopus (3)
Scopus Crossref
Publication Date
Sat Apr 09 2022
Journal Name
Wireless Personal Communications
Strongly Connected Ramanujan Graphs for Highly Symmetric LDPC Codes
...Show More Authors

View Publication
Scopus Clarivate Crossref