Sanhan Muhammad Salih Khasraw
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Sanhan Muhammad Salih Khasraw has a total of 27 co-authors. Here are the top co-authors by number of shared publications:
Nor Haniza Sarmin
Department of Mathematical Sciences, Faculty of Science, Universiti Teknologi Malaysia, 81310 Johor Bahru, Johor, Malaysia
4 shared publications- Justin McInroy
Heilbronn Institute for Mathematical Research School of Mathematics University of Bristol University Walk BS8 1TW Bristol UK
3 shared publications - Nor Haniza Sarmin
Department of Mathematical Sciences, Universiti Teknologi Malaysia
3 shared publications - Nurhidayah Zaid
Department of Mathematical Sciences, Faculty of Science, Universiti Teknologi Malaysia, 81310 Johor Bahru, Johor, Malaysia
3 shared publications - Sergey Shpectorov
School of Mathematics University of Birmingham Edgbaston B15 2TT Birmingham UK
3 shared publications - Ivan Dler Ali
Department of Mathematics College of Education Salahaddin University-Erbil Erbil Kurdistan Region Iraq
2 shared publications
Latest Publications
- Open Access
- 13 April 2025
- Published by Indonesian Mathematical Society in Journal of the Indonesian Mathematical Society
- Vol. 31 (2) , 1838
The Zero Product Probability of Some Finite Ring of Matrices Based on the Order of the Annihilator
An annihilator is defined as the set of pairs of elements in a ring R in which the product of the elements in the pair is the zero element of R. In this paper, we aim to determine the order of the annihilator of the finite ring of matrices of dimension two over integers modulo prime, M2(Zp). The order of the annihilator is determined by using number theory, specifically the linear congruence method. Another subject that we discuss in this paper is the zero product probability of a finite ring. The zero product probability is defined as the probability that two elements of a finite ring have product zero. Based on the order of the annihilator, the general formula of the zero product probability of M2(Zp) is determined.
- 13 April 2025
- Published by Indonesian Mathematical Society in Journal of the Indonesian Mathematical Society
- Vol. 31 (2) , 1838
Open AccessThe Zero Product Probability of Some Finite Ring of Matrices Based on the Order of the Annihilator
An annihilator is defined as the set of pairs of elements in a ring R in which the product of the elements in the pair is the zero element of R. In this paper, we aim to determine the order of the annihilator of the finite ring of matrices of dimension two over integers modulo prime, M2(Zp). The order of the annihilator is determined by using number theory, specifically the linear congruence method. Another subject that we discuss in this paper is the zero product probability of a finite ring. The zero product probability is defined as the probability that two elements of a finite ring have product zero. Based on the order of the annihilator, the general formula of the zero product probability of M2(Zp) is determined.
- 27 September 2024
- Published by Universiti Putra Malaysia in Malaysian Journal of Mathematical Sciences
- Vol. 18 (3) , 491-500
On the Non-Commuting Graph of the Group U6n
Let G be a finite group. The non-commuting graph of G is a simple graph Γ(G) whose vertices are elements of G∖Z(G), where Z(G) is the center of G, and two distinct vertices a and b are joint by an edge if ab≠ba. In this paper, we study the non-commuting graph of the group U6n. The independent number, clique and chromatic numbers of the non-commuting graph of the group U6n, Γ(U6n), are determined. Additionally, the resolving polynomial, total eccentricity and independent polynomials of Γ(U6n) are computed. Finally, the detour and eccentric connectivity indices of Γ(U6n) are found.
- 27 September 2024
- Published by Universiti Putra Malaysia in Malaysian Journal of Mathematical Sciences
- Vol. 18 (3) , 491-500
On the Non-Commuting Graph of the Group U6n
Let G be a finite group. The non-commuting graph of G is a simple graph Γ(G) whose vertices are elements of G∖Z(G), where Z(G) is the center of G, and two distinct vertices a and b are joint by an edge if ab≠ba. In this paper, we study the non-commuting graph of the group U6n. The independent number, clique and chromatic numbers of the non-commuting graph of the group U6n, Γ(U6n), are determined. Additionally, the resolving polynomial, total eccentricity and independent polynomials of Γ(U6n) are computed. Finally, the detour and eccentric connectivity indices of Γ(U6n) are found.
- Open Access
- 3 April 2024
- Published by Akademia Baru Publishing in Journal of Advanced Research in Applied Sciences and Engineering Technology
- Vol. 42 (2) , 112-121
Sombor Index and Sombor Polynomial of the Noncommuting Graph Associated to Some Finite Groups
Sombor index is a newly developed degree-based topological index which involves the degree of the vertex in a simple connected graph. The Sombor index is known as the square root of the sum of the squared degrees of two adjacent vertices in a graph. Meanwhile, the noncommuting graph associated to a group is a graph where its vertices are the non-central elements of the group and two vertices are adjacent if and only if they do not commute. In this study, a new notion called the Sombor polynomial is introduced. Then, the general formula of the Sombor index and the Sombor polynomial of the noncommuting graph associated to some finite groups are determined by using their definitions and some preliminaries. The groups involved in this research are the dihedral groups, the quasidihedral groups, and the generalized quaternion groups. The results found can help the chemists and biologists to predict the chemical and physical properties of the molecules without involving any laboratory work.
- 3 April 2024
- Published by Akademia Baru Publishing in Journal of Advanced Research in Applied Sciences and Engineering Technology
- Vol. 42 (2) , 112-121
Open AccessSombor Index and Sombor Polynomial of the Noncommuting Graph Associated to Some Finite Groups
Sombor index is a newly developed degree-based topological index which involves the degree of the vertex in a simple connected graph. The Sombor index is known as the square root of the sum of the squared degrees of two adjacent vertices in a graph. Meanwhile, the noncommuting graph associated to a group is a graph where its vertices are the non-central elements of the group and two vertices are adjacent if and only if they do not commute. In this study, a new notion called the Sombor polynomial is introduced. Then, the general formula of the Sombor index and the Sombor polynomial of the noncommuting graph associated to some finite groups are determined by using their definitions and some preliminaries. The groups involved in this research are the dihedral groups, the quasidihedral groups, and the generalized quaternion groups. The results found can help the chemists and biologists to predict the chemical and physical properties of the molecules without involving any laboratory work.
- 1 January 2024
- Published by AIP Publishing in AIP Conference Proceedings
- Vol. 3150 (1) , 020011
The first and second Zagreb index of the zero-divisor type graphs of a ring
The zero-divisor type graph for the ring of integers modulo n has vertices Td, with d is a divisor of n. Two distinct vertices are adjacent if and only if the p The zero-divisor type graph for the ring of integers modulo n has vertices Td, with d is a divisor of n. Two distinct vertices are adjacent if and only if the p
- 1 January 2024
- Published by AIP Publishing in AIP Conference Proceedings
- Vol. 3150 (1) , 020011
The first and second Zagreb index of the zero-divisor type graphs of a ring
The zero-divisor type graph for the ring of integers modulo n has vertices Td, with d is a divisor of n. Two distinct vertices are adjacent if and only if the p The zero-divisor type graph for the ring of integers modulo n has vertices Td, with d is a divisor of n. Two distinct vertices are adjacent if and only if the p
- 1 January 2024
- Published by AIP Publishing in AIP Conference Proceedings
- Vol. 3203 (1) , 110009
The nonzero-divisor type graph of rings of integers modulo n and their distance-based topological indices
The zero-divisor type graph has been introduced to ease the computation of some properties of the zero-divisor graph such as the determination of the graph’s pe The zero-divisor type graph has been introduced to ease the computation of some properties of the zero-divisor graph such as the determination of the graph’s pe
- 1 January 2024
- Published by AIP Publishing in AIP Conference Proceedings
- Vol. 3203 (1) , 110009
The nonzero-divisor type graph of rings of integers modulo n and their distance-based topological indices
The zero-divisor type graph has been introduced to ease the computation of some properties of the zero-divisor graph such as the determination of the graph’s pe The zero-divisor type graph has been introduced to ease the computation of some properties of the zero-divisor graph such as the determination of the graph’s pe
- 1 January 2024
- Published by AIP Publishing in AIP Conference Proceedings
- Vol. 3203 (1) , 110018
The zero divisor graph of some finite ring of matrices based on its square-annihilators
A zero divisor graph of a finite ring is defined as a simple graph with its vertices are the zero divisors of the ring, and two distinct vertices are adjacent i A zero divisor graph of a finite ring is defined as a simple graph with its vertices are the zero divisors of the ring, and two distinct vertices are adjacent i
- 1 January 2024
- Published by AIP Publishing in AIP Conference Proceedings
- Vol. 3203 (1) , 110018
The zero divisor graph of some finite ring of matrices based on its square-annihilators
A zero divisor graph of a finite ring is defined as a simple graph with its vertices are the zero divisors of the ring, and two distinct vertices are adjacent i A zero divisor graph of a finite ring is defined as a simple graph with its vertices are the zero divisors of the ring, and two distinct vertices are adjacent i
- 1 January 2024
- Published by AIP Publishing in AIP Conference Proceedings
- Vol. 3203 (1) , 110015
The non-zero divisor graph for the ring of Gaussian integers
Let 𝑅 be a ring. A non-zero divisor graph of 𝑅 is defined as a graph where its vertices are the non-zero elements of R, and two vertices 𝑥 and 𝑦 are adjacen Let 𝑅 be a ring. A non-zero divisor graph of 𝑅 is defined as a graph where its vertices are the non-zero elements of R, and two vertices 𝑥 and 𝑦 are adjacen
- 1 January 2024
- Published by AIP Publishing in AIP Conference Proceedings
- Vol. 3203 (1) , 110015
The non-zero divisor graph for the ring of Gaussian integers
Let 𝑅 be a ring. A non-zero divisor graph of 𝑅 is defined as a graph where its vertices are the non-zero elements of R, and two vertices 𝑥 and 𝑦 are adjacen Let 𝑅 be a ring. A non-zero divisor graph of 𝑅 is defined as a graph where its vertices are the non-zero elements of R, and two vertices 𝑥 and 𝑦 are adjacen
- 1 January 2023
- Published by AIP Publishing in AIP Conference Proceedings
- Vol. 2975 (1)
The total non-zero divisor graph of some commutative rings
In this study, we introduced a new concept of total non-zero divisor graph of a ring. The total non-zero divisor graph of a ring is defined as a simple undirected graph with its vertices are the non-zero elements of the ring and two distinct vertices are connected if and only if their product is not equal to zero, and their sum is in the its zero divisors sets. In this paper, the total non-zero divisor graph is constructed and the connectivity of the graph is explored. We prove that the total non-zero divisor graph is a null graph for the set of integers modulo p. The connectivity of the total non-zero divisor graph is also determined for the set of integers modulo n, where n ≠ p.
- 1 January 2023
- Published by AIP Publishing in AIP Conference Proceedings
- Vol. 2975 (1)
The total non-zero divisor graph of some commutative rings
In this study, we introduced a new concept of total non-zero divisor graph of a ring. The total non-zero divisor graph of a ring is defined as a simple undirected graph with its vertices are the non-zero elements of the ring and two distinct vertices are connected if and only if their product is not equal to zero, and their sum is in the its zero divisors sets. In this paper, the total non-zero divisor graph is constructed and the connectivity of the graph is explored. We prove that the total non-zero divisor graph is a null graph for the set of integers modulo p. The connectivity of the total non-zero divisor graph is also determined for the set of integers modulo n, where n ≠ p.
- Open Access
On Intersection Graph of Dihedral Group
Let $G$ be a finite group. The intersection graph of $G$ is a graph whose vertex set is the set of all proper non-trivial subgroups of $G$ and two distinct vertices $H$ and $K$ are adjacent if and only if $H\cap K \neq \{e\}$, where $e$ is the identity of the group $G$. In this paper, we investigate some properties and exploring some topological indices such as Wiener, Hyper-Wiener, first and second Zagreb, Schultz, Gutman and eccentric connectivity indices of the intersection graph of $D_{2n}$ for $n=p^2$, $p$ is prime. We also find the metric dimension and the resolving polynomial of the intersection graph of $D_{2p^2}$.Open AccessOn Intersection Graph of Dihedral Group
Let $G$ be a finite group. The intersection graph of $G$ is a graph whose vertex set is the set of all proper non-trivial subgroups of $G$ and two distinct vertices $H$ and $K$ are adjacent if and only if $H\cap K \neq \{e\}$, where $e$ is the identity of the group $G$. In this paper, we investigate some properties and exploring some topological indices such as Wiener, Hyper-Wiener, first and second Zagreb, Schultz, Gutman and eccentric connectivity indices of the intersection graph of $D_{2n}$ for $n=p^2$, $p$ is prime. We also find the metric dimension and the resolving polynomial of the intersection graph of $D_{2p^2}$. - Open AccessOn the Non-Commuting Graph of the Group $U_{6n}$A non-commuting graph of a finite group $G$ is a graph whose vertices are non-central elements of $G$ and two vertices are adjacent if they don't commute in $G$. In this paper, we study the non-commuting graph of the group $U_{6n}$ and explore some of its properties including the independent number, clique and chromatic numbers. Also, the general formula of the resolving polynomial of the non-commuting graph of the group $U_{6n}$ are provided. Furthermore, we find the detour index, eccentric connectivity, total eccentricity and independent polynomials of the graph.Open AccessOn the Non-Commuting Graph of the Group $U_{6n}$A non-commuting graph of a finite group $G$ is a graph whose vertices are non-central elements of $G$ and two vertices are adjacent if they don't commute in $G$. In this paper, we study the non-commuting graph of the group $U_{6n}$ and explore some of its properties including the independent number, clique and chromatic numbers. Also, the general formula of the resolving polynomial of the non-commuting graph of the group $U_{6n}$ are provided. Furthermore, we find the detour index, eccentric connectivity, total eccentricity and independent polynomials of the graph.