haider shelash

Dr. haider shelash


Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

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

Representative Publications

View All Publications
30 January 2023 in Afrika Matematika
Verified
Journal Article
Closed access
PDF file
HHHayder R. Hashim
Hayder R. Hashim
FLFlorian Luca
Florian Luca
HShaider shelash
haider shelash
ASAli A. Shukur
Ali A. Shukur

11 December 2019 in Facta Universitatis, Series: Mathematics and Informatics
Verified
Journal Article
Closed access
PDF file
HShaider shelash
haider shelash
The aim of this paper is to compute the number of subgroups and normal subgroups of the group $U_{2np}=\langle a,b\mid a^{2n}=b^{p}=e, aba^{-1}=b^{-1} \rangle$, where $p$ is an odd prime. Suppose $n=2^r\prod_{1 \leq i \leq s}p_{i}^{\alpha_{i}}$ in which $p_i$'s are distinct odd primes, $\alpha_i$'s are positive integers and $t=\prod_{1 \leq i \leq s}p_{i}^{\alpha_{i}}$. It is proved that the number of subgroups is $2\tau(2n)+(p-1)\left(\tau(\frac{n}{p})+\tau(\frac{n}{2^r}) \right)$, when $p \mid n$ and $2\tau(2n)+(p-1) \left[ \tau(t)\right]$, otherwise. It will be also proved that this group has $\tau(2n)+\tau(n)$ normal subgroups.

17 May 2021 in Mathematical Problems in Engineering
Verified
Journal Article
Open access
PDF file
ASAli A. Shukur
Ali A. Shukur
AJAkbar Jahanbani
Akbar Jahanbani
HShaider shelash
haider shelash
Studying the orbit of an element in a discrete dynamical system is one of the most important areas in pure and applied mathematics. It is well known that each graph contains a finite (or infinite) number of elements. In this work, we introduce a new analytical phenomenon to the weighted graphs by studying the orbit of their elements. Studying the weighted graphs orbit allows us to have a better understanding to the behaviour of the systems (graphs) during determined time and environment. Moreover, the energy of the graphs orbit is given.

1 June 2020
Verified
Open access
PDF file
HShaider shelash
haider shelash
ASAli Shukur
Ali Shukur
Let G be a simple graph of order N, the concept of resol-vent energy of graph G; i.e. ER(G)=sum_{i=1}^N (N - λi)^{-1} was established in Resolvent Energy of Graphs, MATCH commun. Math. comput. chem., 75 (2016), 279-290. In this paper we study the set of resol-vents energies of graph G which it is called pseudospectrum energy of graph PS(G). For large value resolvent energy of graph ER(G) and real eigenvalues, we establish a number of properties of PS(G): For complex eigenvalues, some examples of PS(G) are given.

1 March 2021 in Journal of Physics: Conference Series
Verified
Conference Paper
Open access
PDF file
HMH. J. Mehdi
H. J. Mehdi
HShaider shelash
haider shelash
Let τ(n) is the number of all divisors of n and σ(n) is the number of summation of all divisors n, Cavior, presented the number of all subgroups of the dihedral group is equal by τ(n) + σ(n). We in this paper determines a formula for the number of subgroups, normal and cyclic subgroups of the group G = D 2n × C p = 〈a, b, c|a n = b 2 = c p , b a b = a −1, [a, c] = [b, c] = 1〉, where p is an odd prime number.

1 March 2021 in Journal of Physics: Conference Series
Verified
Conference Paper
Open access
PDF file
WSW. M. Salah
W. M. Salah
HShaider shelash
haider shelash
Let Γ(V, E) be a graph. The Cayley graph of group (G,∗) and a subset S is a graph denoted by C a y(G, S), it is with vertex set V(C a y(G, S)) = G and two vertices x, y ∈ G are join if and only if y = x s ∈ S for some s ∈ S. In this paper, we obtain characteristics of Cayley graphs under some graph operations, Graph direct product, Graph tenser product, Graph strong product when G isomorphic to Cyclic group C n and Dihedral Group D 2n .