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
Sun Aug 15 2021
Journal Name
Al-qadisiyah Journal Of Pure Science Vol.(26) Issue (special Issue Num.4) (2021) Pp. 30–33
Accounts for the groups (2, ), = 41 and 43
...Show More Authors

Publication Date
Wed Jun 01 2022
Journal Name
Baghdad Science Journal
Schultz and Modified Schultz Polynomials for Edge – Identification Chain and Ring – for Square Graphs
...Show More Authors

In a connected graph , the distance function between each pair of two vertices from a set vertex  is the shortest distance between them and the vertex degree  denoted by  is the number of edges which are incident to the vertex  The Schultz and modified Schultz polynomials of  are have defined as:

 respectively, where the summations are taken over all unordered pairs of distinct vertices in  and  is the distance between  and  in  The general forms of Schultz and modified Schultz polynomials shall be found and indices of the edge – identification chain and ring – square graphs in the present work.

View Publication Preview PDF
Scopus (4)
Crossref (1)
Scopus Clarivate Crossref
Publication Date
Wed Mar 01 2023
Journal Name
Baghdad Science Journal
An Investigation of Corona Domination Number for Some Special Graphs and Jahangir Graph
...Show More Authors

In this work,  the study of corona domination in graphs is carried over which was initially proposed by G. Mahadevan et al. Let be a simple graph. A dominating set S of a graph is said to be a corona-dominating set if every vertex in is either a pendant vertex or a support vertex. The minimum cardinality among all corona-dominating sets is called the corona-domination number and is denoted by (i.e) . In this work, the exact value of the corona domination number for some specific types of graphs are given. Also, some results on the corona domination number for some classes of graphs are obtained and the method used in this paper is a well-known number theory concept with some modification this method can also be applied to obt

... Show More
View Publication Preview PDF
Scopus (4)
Crossref (2)
Scopus Clarivate Crossref
Publication Date
Wed Aug 10 2022
Journal Name
Mathematical Statistician And Engineering Applications
Results for the Groups SL(2,34 ) and SL(2,36 )
...Show More Authors

Publication Date
Sat Oct 08 2022
Journal Name
Mathematical Statistician And Engineering Applications
Illation for the Groups SL(2,112 ) and SL(2,132 )
...Show More Authors

Publication Date
Sun Jan 01 2023
Journal Name
Journal Of Interdisciplinary Mathematics
Enforcement for the groups SL(2,125) and SL(2,3125)
...Show More Authors

The group for the multiplication of closets is the set G|N of all closets of N in G, if G is a group and N is a normal subgroup of G. The term “G by N factor group” describes this set. In the quotient group G|N, N is the identity element. In this paper, we procure K(SL(2,125)) and K(SL(2,3125)) from the character table of rational representations for each group.

View Publication
Scopus (11)
Scopus Clarivate Crossref
Publication Date
Mon Oct 02 2023
Journal Name
Journal Of Interdisciplinary Mathematics
Score for the groups SL(2,121) and SL(2,169)
...Show More Authors

A factor group is a mathematical group obtained by aggregating similar elements of a larger group using an equivalence relation that preserves some of the group structure. In this paper, the factor groups K(SL(2,121)) and K(SL(2,169)) computed for each group from the character table of rational representations.

View Publication
Scopus (11)
Scopus Clarivate Crossref
Publication Date
Sun Jan 01 2023
Journal Name
Journal Of Interdisciplinary Mathematics
Computations for the groups SL(2,81) and SL(2,729)
...Show More Authors

For any group G, we define G/H (read” G mod H”) to be the set of left cosets of H in G and this set forms a group under the operation (a)(bH) = abH. The character table of rational representations study to gain the K( SL(2,81)) and K( SL(2, 729)) in this work.

View Publication
Scopus (11)
Scopus Clarivate Crossref
Publication Date
Wed Mar 01 2023
Journal Name
Baghdad Science Journal
Stability of Complement Degree Polynomial of Graphs
...Show More Authors

     A graph is a structure amounting to a set of objects in which some pairs of the objects are in some sense related. The objects correspond to mathematical abstractions called vertices (also called nodes or points) and each of the related pairs of vertices is called an edge (also called link or line). A directed graph is a graph in which edges have orientation. A simple graph is a graph that does not have more than one edge between any two vertices and no edge starts and ends at the same vertex.  For a simple undirected graph G with order n, and let  denotes its complement. Let δ(G), ∆(G) denotes the minimum degree and maximum degree of G respectively. The complement degree polynomial of G is the polynomial CD[G,x]= , where C

... Show More
View Publication Preview PDF
Scopus (1)
Scopus Clarivate Crossref
Publication Date
Thu Feb 01 2024
Journal Name
Baghdad Science Journal
Forgotten Index and Forgotten Coindex of Graphs
...Show More Authors

F index is a connected graph, sum of the cubes of the vertex degrees. The forgotten topological index has been designed to be employed in the examination of drug molecular structures, which is extremely useful for pharmaceutical and medical experts in understanding the biological activities. Among all the topological indices, the forgotten index is based on degree connectivity on bonds. This paper characterized the forgotten index of union of graphs, join graphs, limits on trees and its complements, and accuracy is measured. Co-index values are analyzed for the various molecular structure of chemical compounds

View Publication Preview PDF
Scopus (2)
Crossref (1)
Scopus Crossref