Sanhan Khasraw

Dr. Sanhan Khasraw


Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
2 December 2019 in Transactions of the American Mathematical Society
Verified
Journal Article
Closed access
PDF file
SKSanhan Khasraw
Sanhan Khasraw
JMJ. McInroy
J. McInroy
SSS. Shpectorov
S. Shpectorov
Axial algebras are a recently introduced class of non-associative algebra motivated by applications to groups and vertex-operator algebras. We develop the structure theory of axial algebras focussing on two major topics: (1) radical and simplicity, and (2) sum decompositions.

16 October 2020 in Electronic Journal of Graph Theory and Applications
Verified
Journal Article
Open access
PDF file
SKSanhan Khasraw
Sanhan Khasraw
IAIvan Dler Ali
Ivan Dler Ali
RHRashad Rashid Haji
Rashad Rashid Haji
On the non-commuting graph of dihedral group

17 August 2020 in Malaysian Journal of Fundamental and Applied Sciences
Verified
Journal Article
Open access
PDF file
SKSanhan Khasraw
Sanhan Khasraw
In this paper, the probability that two elements of a finite ring have product zero is considered. The bounds of this probability are found for an arbitrary finite commutative ring with identity 1. An explicit formula for this probability in the case of, the ring of integers modulo, is obtained.

3 April 2024 in Journal of Advanced Research in Applied Sciences and Engineering Technology
Verified
Journal Article
Open access
PDF file
SKSanhan Khasraw
Sanhan Khasraw
NSNor Haniza Sarmin
Nor Haniza Sarmin
NANur Idayu Alimon
Nur Idayu Alimon
NNNabilah Najmuddin
Nabilah Najmuddin
GSGhazali Semil@Ismail
Ghazali Semil@Ismail
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.

27 September 2024 in Malaysian Journal of Mathematical Sciences
Verified
Journal Article
Closed access
SKSanhan Khasraw
Sanhan Khasraw
CAC. Abdulla
C. Abdulla
NSN. H. Sarmin
N. H. Sarmin
IGI. Gambo
I. Gambo
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.

1 January 2017
Verified
Conference Paper
Closed access
SZSiti Norziahidayu Amzee Zamri
Siti Norziahidayu Amzee Zamri
NSNor Haniza Sarmin
Nor Haniza Sarmin
SKSanhan Khasraw
Sanhan Khasraw
SOSanaa Mohamed Saleh Omer
Sanaa Mohamed Saleh Omer
MEMustafa Anis El-Sanfaz
Mustafa Anis El-Sanfaz
Let G be a metacyclic 5-group and Ω is the set of all ordered pairs (x, y) in G × G such that lcm(|x|, |y|) = 5, xy = yx and x ≠ y. In this paper, the probability that an element of G fixes a set Ω is determined by using conjugation action. The results obtained are then applied to graph theory, more precisely to the orbit graph.