Zobrazeno 1 - 10
of 107
pro vyhledávání: '"KHALIFEH, A. H."'
Autor:
Al Omar, Saleh1 (AUTHOR), Khalifeh, Anas H.2 (AUTHOR) akhalifeh@zu.edu.jo, Hammad, Bahaaeddin M.3 (AUTHOR), Abdelrahim, Zakaria M.4 (AUTHOR)
Publikováno v:
PLoS ONE. 10/8/2024, Vol. 19 Issue 10, p1-10. 10p.
Autor:
Abualruz, Hasan, Hayajneh, Ferial, Othman, Elham H., Abu Sabra, Mohammad A., Khalil, Malek M., Khalifeh, Anas H., Yasin, Islam, Alhamory, Sajeda, Zyoud, Amr H., Abousoliman, Ali D.
Publikováno v:
In Archives of Psychiatric Nursing August 2024 51:108-113
Publikováno v:
In Journal of Pediatric Nursing July-August 2024 77:45-52
Autor:
Khalifeh, M. H., Esfahanian, A. -H.
An added edge to a graph is called an inset edge. Predicting k inset edges which minimize the average distance of a graph is known to be NP-Hard. However, when k = 1 the complexity of the problem is polynomial. In this paper, some tools for a precise
Externí odkaz:
http://arxiv.org/abs/2008.05677
Autor:
Khalifeh, M. H., Esfahanian, A. -H.
An added edge to a graph is called an inset edge. Predicting k inset edges which minimize the average distance of a graph is known to be NP-Hard. When k = 1 the complexity of the problem is polynomial. In this paper, we further find the single inset
Externí odkaz:
http://arxiv.org/abs/2008.05674
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.
If $G$ is a graph then a subgraph $H$ is $isometric$ if, for every pair of vertices $u,v$ of $H$, we have $d_H(u,v) = d_G(u,v)$ where $d$ is the distance function. We say a graph $G$ is $distance\ preserving\ (dp)$ if it has an isometric subgraph of
Externí odkaz:
http://arxiv.org/abs/1507.04800
Autor:
Khalifeh, M. H.1 (AUTHOR) esfahanian@msu.edu, Esfahanian, Abdol-Hossein1 (AUTHOR)
Publikováno v:
Mathematics (2227-7390). Apr2023, Vol. 11 Issue 7, p1678. 19p.
Publikováno v:
Mental Health and Social Inclusion, 2020, Vol. 24, Issue 3, pp. 135-144.
Externí odkaz:
http://www.emeraldinsight.com/doi/10.1108/MHSI-04-2020-0022
Publikováno v:
Current Nanoscience, Volume 9, Number 4, August 2013 , pp. 557-560(4)
The aim of this paper is the computing one of topological indices of One-pentagonal carbon Nanocone. One-pentagonal carbon nanocone consists of one pentagone as its core surrounded by layers of hexagons .if there are n layers,then the graph of this m
Externí odkaz:
http://arxiv.org/abs/1212.4411