Zobrazeno 1 - 10
of 32
pro vyhledávání: '"Abughneim Omar A."'
Autor:
Abughneim Omar A., Abughazaleh Baha’
Publikováno v:
Open Mathematics, Vol 22, Iss 1, Pp 365-3566 (2024)
In the context of a simple undirected graph GG, a kk-prime labeling refers to assigning distinct integers from the set {k,k+1,…,∣V(G)∣+k−1}\left\{k,k+1,\ldots ,| V\left(G)| +k-1\right\} to its vertices, such that adjacent vertices in GG are l
Externí odkaz:
https://doaj.org/article/3178320beb4341d7a5ade9b4940d11fa
Let $X$ be bipartite mixed graph and for a unit complex number $\alpha$, $H_\alpha$ be its $\alpha$-hermitian adjacency matrix. If $X$ has a unique perfect matching, then $H_\alpha$ has a hermitian inverse $H_\alpha^{-1}$. In this paper we give a ful
Externí odkaz:
http://arxiv.org/abs/2205.07010
Autor:
Abughneim, Omar A.1 o.abughneim@ju.edu.jo, Abughazaleh, Baha'2 baha.abughazaleh@iu.edu.jo
Publikováno v:
European Journal of Pure & Applied Mathematics. Oct2024, Vol. 17 Issue 4, p3557-3566. 10p.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Abughazaleh, Baha' a, Abughneim, Omar A. b, ⁎
Publikováno v:
In Heliyon 30 January 2024 10(2)
In 1978, Robert Kibler at the National Security Agency in Fort Meade, Maryland published a description of all noncyclic difference sets with $k < 20$. Kibler's decision to stop his extensive computer search for difference sets at block size 19 was mo
Externí odkaz:
http://arxiv.org/abs/1808.00576
Autor:
AbuGhneim, Omar A. a, ⁎, 1, Abudayah, Mohammed b
Publikováno v:
In Heliyon December 2022 8(12)
Autor:
ABUGHAZALEH, BAHA1 baha.abughazaleh@iu.edu.jo, ABUGHNEIM, OMAR A.2 o.abughneim@ju.edu.jo
Publikováno v:
Transactions on Combinatorics. Summer2023, Vol. 12 Issue 2, p107-113. 7p.
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 35, Iss 2, Pp 301-311 (2015)
In this paper, we show that Qkn is a divisor graph, for n = 2, 3. For n ≥ 4, we show that Qkn is a divisor graph iff k ≥ n − 1. For folded-hypercube, we get FQn is a divisor graph when n is odd. But, if n ≥ 4 is even integer, then FQn is not
Externí odkaz:
https://doaj.org/article/849f7fc0fc474b63883d789b51e30992
Publikováno v:
The Rocky Mountain Journal of Mathematics, 2012 Jan 01. 42(1), 1-13.
Externí odkaz:
https://www.jstor.org/stable/44240032