Hazzirah Izzati Mat Hassim
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Hazzirah Izzati Mat Hassim has a total of 15 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
7 shared publications- Ahmad Erfanian
Department of Pure Mathematics and Center of Excellence in Analysis on Algebraic Structures, Ferdowsi University of Mashhad, Mashhad, Iran
3 shared publications Athirah Zulkarnain
Department of Mathematical Sciences, Faculty of Science, Universiti Teknologi Malaysia, 81310 UTM, Johor Bahru, Johor, Malaysia
3 shared publications- Siti Afiqah Mohammad
Department of Mathematical Sciences, Faculty of Science, Universiti Teknologi Malaysia, 81310 UTM Johor Bahru, Johor, Malaysia
3 shared publications - Nor Haniza Sarmin
Department of Mathematical Sciences, Universiti Teknologi Malaysia
2 shared publications - Ahmad Firdaus Yosman
Department of Mathematical Sciences, Faculty of Science, Universiti Teknologi Malaysia, 81310 UTM Johor Bahru, Johor, Malaysia
1 shared publication
Latest Publications
- Open Access
- 15 December 2024
- Published by Akademia Baru Publishing in Semarak International Journal of Fundamental and Applied Mathematics
- Vol. 4 (1) , 32-47
The Union Prime Power Order Cayley Graph of Certain Cyclic Groups and their Topological Indices
Cayley graph is a variation of graphs that focuses on constructing and analyzing graphs using algebraic structures. Meanwhile, topological indices of graphs are numerical values that reflect various aspects of the graphs’ structure. Over the years, many variants of Cayley graphs have been constructed due to the significance of understanding the order of elements within a group’s subset but not on the union of subsets with specific order of elements. In this paper, a new variant of Cayley graph, namely the union prime power order Cayley graph of a group with respect to subset is formed by combining all possible subsets of . In addition, the union prime power order Cayley graph is constructed for cyclic groups of order and , where is a prime, and their generalizations are determined. Moreover, the topological indices, which are the Wiener index, mean distance, first Zagreb index, and second Zagreb index are also computed for these graphs. Existing definitions and theorems of Cayley graphs and topological indices are analyzed to define the new variant of the Cayley graph and establish the general form of its topological indices.
- 15 December 2024
- Published by Akademia Baru Publishing in Semarak International Journal of Fundamental and Applied Mathematics
- Vol. 4 (1) , 32-47
Open AccessThe Union Prime Power Order Cayley Graph of Certain Cyclic Groups and their Topological Indices
Cayley graph is a variation of graphs that focuses on constructing and analyzing graphs using algebraic structures. Meanwhile, topological indices of graphs are numerical values that reflect various aspects of the graphs’ structure. Over the years, many variants of Cayley graphs have been constructed due to the significance of understanding the order of elements within a group’s subset but not on the union of subsets with specific order of elements. In this paper, a new variant of Cayley graph, namely the union prime power order Cayley graph of a group with respect to subset is formed by combining all possible subsets of . In addition, the union prime power order Cayley graph is constructed for cyclic groups of order and , where is a prime, and their generalizations are determined. Moreover, the topological indices, which are the Wiener index, mean distance, first Zagreb index, and second Zagreb index are also computed for these graphs. Existing definitions and theorems of Cayley graphs and topological indices are analyzed to define the new variant of the Cayley graph and establish the general form of its topological indices.
- Open Access
- 28 February 2024
- Published by Akademia Baru Publishing in Journal of Advanced Research in Applied Sciences and Engineering Technology
- Vol. 40 (2) , 212-220
Power Cayley Graphs of Dihedral Groups with Certain Order
Combination of the concepts of power graph and Cayley graph associated to groups has led to the introduction to two new variations of Cayley graph known as the union power Cayley graph and the intersection power Cayley graph. The set of vertices for both graphs consist of the elements of a finite group G. Consider any inverse-closed subset S of G, two vertices x and y are adjacent in the union power Cayley graph if 〖xy〗^(-1)∈S or if either one is an integral power of the other. Furthermore, x and y are adjacent in the intersection power Cayley graph if 〖xy〗^(-1)∈S and if either one is an integral power of the other. In this paper, the generalization of the union power Cayley graphs and the intersection power Cayley graphs of the dihedral groups with order 2n, for n≥3 and n=P^m;P is prime and m is a natural number, relative to a specific subset containing rotation elements in the groups is found. In addition, properties of these graphs including the clique numbers, vertex chromatic numbers, girths and diameters are computed. Finally, the characteristics of the graphs, whether they are connected, regular, complete, and planar are also determined.
- 28 February 2024
- Published by Akademia Baru Publishing in Journal of Advanced Research in Applied Sciences and Engineering Technology
- Vol. 40 (2) , 212-220
Open AccessPower Cayley Graphs of Dihedral Groups with Certain Order
Combination of the concepts of power graph and Cayley graph associated to groups has led to the introduction to two new variations of Cayley graph known as the union power Cayley graph and the intersection power Cayley graph. The set of vertices for both graphs consist of the elements of a finite group G. Consider any inverse-closed subset S of G, two vertices x and y are adjacent in the union power Cayley graph if 〖xy〗^(-1)∈S or if either one is an integral power of the other. Furthermore, x and y are adjacent in the intersection power Cayley graph if 〖xy〗^(-1)∈S and if either one is an integral power of the other. In this paper, the generalization of the union power Cayley graphs and the intersection power Cayley graphs of the dihedral groups with order 2n, for n≥3 and n=P^m;P is prime and m is a natural number, relative to a specific subset containing rotation elements in the groups is found. In addition, properties of these graphs including the clique numbers, vertex chromatic numbers, girths and diameters are computed. Finally, the characteristics of the graphs, whether they are connected, regular, complete, and planar are also determined.
- 1 January 2024
- Published by AIP Publishing in AIP Conference Proceedings
- Vol. 3150 (1) , 020009
The prime power Cayley graph for cylic groups of order pq
A Cayley graph is a graph of a group that is build based on a specific subset of the group. The vertices of the graph are the elements of the group, and two dif A Cayley graph is a graph of a group that is build based on a specific subset of the group. The vertices of the graph are the elements of the group, and two dif
- 1 January 2024
- Published by AIP Publishing in AIP Conference Proceedings
- Vol. 3150 (1) , 020009
The prime power Cayley graph for cylic groups of order pq
A Cayley graph is a graph of a group that is build based on a specific subset of the group. The vertices of the graph are the elements of the group, and two dif A Cayley graph is a graph of a group that is build based on a specific subset of the group. The vertices of the graph are the elements of the group, and two dif
- 1 January 2024
- Published by AIP Publishing in AIP Conference Proceedings
- Vol. 3203 (1) , 110005
A variation of Cayley graph for cyclic groups of composite order
A Cayley graph of a group is a graph associated with the generating subset of the group. Meanwhile, a pi-Cayley graph is a variation of the Cayley graph where p A Cayley graph of a group is a graph associated with the generating subset of the group. Meanwhile, a pi-Cayley graph is a variation of the Cayley graph where p
- 1 January 2024
- Published by AIP Publishing in AIP Conference Proceedings
- Vol. 3203 (1) , 110005
A variation of Cayley graph for cyclic groups of composite order
A Cayley graph of a group is a graph associated with the generating subset of the group. Meanwhile, a pi-Cayley graph is a variation of the Cayley graph where p A Cayley graph of a group is a graph associated with the generating subset of the group. Meanwhile, a pi-Cayley graph is a variation of the Cayley graph where 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
- Open Access
- 1 July 2021
- Published by IOP Publishing in Journal of Physics: Conference Series
- Vol. 1988 (1) , 012075
Closure properties of bonded sequential insertion-deletion systems
Through the years, formal language theory has evolved through continual interdisciplinary work in theoretical computer science, discrete mathematics and molecular biology. The combination of these areas resulted in the birth of DNA computing. Here, language generating devices that usually considered any set of letters have taken on extra restrictions or modified constructs to simulate the behavior of recombinant DNA. A type of these devices is an insertion-deletion system, where the operations of insertion and deletion of a word have been combined in a single construct. Upon appending integers to both sides of the letters in a word, bonded insertion-deletion systems were introduced to accurately depict chemical bonds in chemical compounds. Previously, it has been shown that bonded sequential insertion-deletion systems could generate up to recursively enumerable languages. However, the closure properties of these systems have yet to be determined. In this paper, it is shown that bonded sequential insertion-deletion systems are closed under union, concatenation, concatenation closure, λ-free concatenation closure, substitution and intersection with regular languages. Hence, the family of languages generated by bonded sequential insertion-deletion systems is shown to be a full abstract family of languages.
- 1 July 2021
- Published by IOP Publishing in Journal of Physics: Conference Series
- Vol. 1988 (1) , 012075
Open AccessClosure properties of bonded sequential insertion-deletion systems
Through the years, formal language theory has evolved through continual interdisciplinary work in theoretical computer science, discrete mathematics and molecular biology. The combination of these areas resulted in the birth of DNA computing. Here, language generating devices that usually considered any set of letters have taken on extra restrictions or modified constructs to simulate the behavior of recombinant DNA. A type of these devices is an insertion-deletion system, where the operations of insertion and deletion of a word have been combined in a single construct. Upon appending integers to both sides of the letters in a word, bonded insertion-deletion systems were introduced to accurately depict chemical bonds in chemical compounds. Previously, it has been shown that bonded sequential insertion-deletion systems could generate up to recursively enumerable languages. However, the closure properties of these systems have yet to be determined. In this paper, it is shown that bonded sequential insertion-deletion systems are closed under union, concatenation, concatenation closure, λ-free concatenation closure, substitution and intersection with regular languages. Hence, the family of languages generated by bonded sequential insertion-deletion systems is shown to be a full abstract family of languages.
- Open Access
- 15 June 2020
- Published by Penerbit UTM Press in Malaysian Journal of Fundamental and Applied Sciences
- Vol. 16 (3) , 297-299
The conjugacy class graphs of non-abelian 3-groups
A graph is formed by a pair of vertices and edges. It can be related to groups by using the groups’ properties for its vertices and edges. The set of vertices of the graph comprises the elements or sets from the group while the set of edges of the graph is the properties and condition for the graph. A conjugacy class of an element is the set of elements that are conjugated with . Any element of a group , labelled as , is conjugated to if it satisfies for some elements in with its inverse . A conjugacy class graph of a group is defined when its vertex set is the set of non-central conjugacy classes of . Two distinct vertices and are connected by an edge if and only if their cardinalities are not co-prime, which means that the order of the conjugacy classes of and have common factors. Meanwhile, a simple graph is the graph that contains no loop and no multiple edges. A complete graph is a simple graph in which every pair of distinct vertices is adjacent. Moreover, a -group is the group with prime power order. In this paper, the conjugacy class graphs for some non-abelian 3-groups are determined by using the group’s presentations and the definition of conjugacy class graph. There are two classifications of the non-abelian 3-groups which are used in this research. In addition, some properties of the conjugacy class graph such as the chromatic number, the dominating number, and the diameter are computed. A chromatic number is the minimum number of vertices that have the same colours where the adjacent vertices have distinct colours. Besides, a dominating number is the minimum number of vertices that is required to connect all the vertices while a diameter is the longest path between any two vertices. As a result of this research, the conjugacy class graphs of these groups are found to be complete graphs with chromatic number, dominating number and diameter that are equal to eight, one and one, respectively.
- 15 June 2020
- Published by Penerbit UTM Press in Malaysian Journal of Fundamental and Applied Sciences
- Vol. 16 (3) , 297-299
Open AccessThe conjugacy class graphs of non-abelian 3-groups
A graph is formed by a pair of vertices and edges. It can be related to groups by using the groups’ properties for its vertices and edges. The set of vertices of the graph comprises the elements or sets from the group while the set of edges of the graph is the properties and condition for the graph. A conjugacy class of an element is the set of elements that are conjugated with . Any element of a group , labelled as , is conjugated to if it satisfies for some elements in with its inverse . A conjugacy class graph of a group is defined when its vertex set is the set of non-central conjugacy classes of . Two distinct vertices and are connected by an edge if and only if their cardinalities are not co-prime, which means that the order of the conjugacy classes of and have common factors. Meanwhile, a simple graph is the graph that contains no loop and no multiple edges. A complete graph is a simple graph in which every pair of distinct vertices is adjacent. Moreover, a -group is the group with prime power order. In this paper, the conjugacy class graphs for some non-abelian 3-groups are determined by using the group’s presentations and the definition of conjugacy class graph. There are two classifications of the non-abelian 3-groups which are used in this research. In addition, some properties of the conjugacy class graph such as the chromatic number, the dominating number, and the diameter are computed. A chromatic number is the minimum number of vertices that have the same colours where the adjacent vertices have distinct colours. Besides, a dominating number is the minimum number of vertices that is required to connect all the vertices while a diameter is the longest path between any two vertices. As a result of this research, the conjugacy class graphs of these groups are found to be complete graphs with chromatic number, dominating number and diameter that are equal to eight, one and one, respectively.
- Open Access
- 28 October 2017
- Published by IOP Publishing in Journal of Physics: Conference Series
- Vol. 893 (1) , 012006
The nonabelian tensor square of a crystallographic group with quaternion point group of order eight
A crystallographic group is a discrete subgroup of the set of isometries of Euclidean space where the quotient space is compact. A torsion free crystallographic group, or also known as a Bieberbach group has the symmetry structure that will reveal its algebraic properties. One of the algebraic properties is its nonabelian tensor square. The nonabelian tensor square is a special case of the nonabelian tensor product where the product is defined if the two groups act on each other in a compatible way and their action is taken to be conjugation. Meanwhile, Bieberbach group with quaternion point group of order eight is a polycyclic group. In this paper, by using the polycyclic method, the computation of the nonabelian tensor square of this group will be shown.
- 28 October 2017
- Published by IOP Publishing in Journal of Physics: Conference Series
- Vol. 893 (1) , 012006
Open AccessThe nonabelian tensor square of a crystallographic group with quaternion point group of order eight
A crystallographic group is a discrete subgroup of the set of isometries of Euclidean space where the quotient space is compact. A torsion free crystallographic group, or also known as a Bieberbach group has the symmetry structure that will reveal its algebraic properties. One of the algebraic properties is its nonabelian tensor square. The nonabelian tensor square is a special case of the nonabelian tensor product where the product is defined if the two groups act on each other in a compatible way and their action is taken to be conjugation. Meanwhile, Bieberbach group with quaternion point group of order eight is a polycyclic group. In this paper, by using the polycyclic method, the computation of the nonabelian tensor square of this group will be shown.
- 1 January 2016
- Published by AIP Publishing in AIP Conference Proceedings
- Vol. 1750 (1) , 050005
The central subgroup of the nonabelian tensor square of a torsion free space group
Space groups of a crystal expound its symmetry properties. One of the symmetry properties is the central subgroup of the nonabelian tensor square of a group. It is a normal subgroup of the group which can be ascertained by finding the abelianisation of the group and the nonabelian tensor square of the abelianisation group. In this research, our focus is to explicate the central subgroup of the nonabelian tensor square of the torsion free space groups of a crystal which are called the Bieberbach groups.
- 1 January 2016
- Published by AIP Publishing in AIP Conference Proceedings
- Vol. 1750 (1) , 050005
The central subgroup of the nonabelian tensor square of a torsion free space group
Space groups of a crystal expound its symmetry properties. One of the symmetry properties is the central subgroup of the nonabelian tensor square of a group. It is a normal subgroup of the group which can be ascertained by finding the abelianisation of the group and the nonabelian tensor square of the abelianisation group. In this research, our focus is to explicate the central subgroup of the nonabelian tensor square of the torsion free space groups of a crystal which are called the Bieberbach groups.
- 1 January 2016
- Published by AIP Publishing
- Vol. 1707 (1) , 020012
Consistent polycyclic presentation of a Bieberbach group with a nonabelian point group
Research on the nonabelian tensor square of a group is requisite on finding the other homological functors. One of the methods to explicate the nonabelian tensor square is to ensure the presentation of the group is polycyclic and to prove its consistency. In this research, the polycyclic presentation of a Bieberbach group with the quaternion point group of order eight is shown to be consistent.
- 1 January 2016
- Published by AIP Publishing
- Vol. 1707 (1) , 020012
Consistent polycyclic presentation of a Bieberbach group with a nonabelian point group
Research on the nonabelian tensor square of a group is requisite on finding the other homological functors. One of the methods to explicate the nonabelian tensor square is to ensure the presentation of the group is polycyclic and to prove its consistency. In this research, the polycyclic presentation of a Bieberbach group with the quaternion point group of order eight is shown to be consistent.