Zobrazeno 1 - 10
of 16
pro vyhledávání: '"Patrick Ali"'
Publikováno v:
Indonesian Journal of Geography, Vol 49, Iss 2, Pp 145-154 (2017)
This study examined the spatio-temporal analysis of urban crime pattern and its implication for Abuja Municipal Area Council of the Federal Capital Territory of Nigeria; it has the aim of using Geographical Information System to improve criminal just
Externí odkaz:
https://doaj.org/article/b588dfa790f9429fa8b3fcd01323dc3a
Publikováno v:
2023 6th International Conference on Information Systems and Computer Networks (ISCON).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::02af4115b9e28a8191f4f6c32a601745
https://doi.org/10.1109/iscon57294.2023.10112016
https://doi.org/10.1109/iscon57294.2023.10112016
Autor:
Patrick Ali, Edy Tri Baskoro
Publikováno v:
Discrete Mathematics, Algorithms and Applications.
For a connected graph [Formula: see text] of order [Formula: see text] and a set [Formula: see text], the Steiner distance of [Formula: see text] is the minimum number of edges in a connected subgraph of [Formula: see text] containing [Formula: see t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::feaee2980d6945ad16ee1160c6715b91
https://doi.org/10.1142/s1793830922501592
https://doi.org/10.1142/s1793830922501592
Graph invariants such as distance have a wide application in life, in particular when networks represent scenarios in form of either a bipartite or non-bipartite graph. Average distance μ of a graph G is one of the well-studied graph invariants. The
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2c7d8f430d9cb76389e737d672b833d3
https://mts.intechopen.com/articles/show/title/on-average-distance-of-neighborhood-graphs-and-its-applications
https://mts.intechopen.com/articles/show/title/on-average-distance-of-neighborhood-graphs-and-its-applications
Publikováno v:
Linear and Multilinear Algebra. 68:323-336
The resistance matrix of a simple connected graph G is denoted by RG or simply by R and is defined by RG=(rij), where rij is the resistance distance between the vertices i and j in G. In this paper...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bb5c75eef0614e7838e890b6cae0a74f
https://doi.org/10.1080/03081087.2018.1505822
https://doi.org/10.1080/03081087.2018.1505822
Autor:
Adewuyi, Taiye Oluwafemi1, Eneji, Patrick Ali2, Baduku, Anthonia Silas3, Olofin, Emmanuel Ajayi4 taiyeadewuyi@yahoo.com
Publikováno v:
Indonesian Journal of Geography. Dec2017, Vol. 49 Issue 2, p145-154. 10p.
Publikováno v:
International Journal on Cryptography and Information Security. 7:01-13
Password authentication with smart card is one of the simplest and efficient authentication mechanisms to ensure secure communication over insecure network environments. Recently, Tsai et al. proposed an improved password authentication scheme for sm
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2df2d6871c7f70de160df228cdd20ec6
https://doi.org/10.5121/ijcis.2017.7301
https://doi.org/10.5121/ijcis.2017.7301
Publikováno v:
SSRN Electronic Journal.
One of the most commonly used user authentication mechanisms is two factor authentication based on smart card and password. The core feature of the scheme is to enforce that the user must have the smart card and know the password in order to gain acc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::372f6a8a95888254b2006db2930b91bc
https://doi.org/10.2139/ssrn.3438551
https://doi.org/10.2139/ssrn.3438551
Publikováno v:
Discrete Applied Mathematics. 179:222-228
Let G be a connected graph of order p and S a nonempty set of vertices of G . Then the Steiner distance d ( S ) of S is the minimum size of a connected subgraph of G whose vertex set contains S . If n is an integer, 2 ? n ? p , the Steiner n -diamete
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e4c68d856f7560fac210ff4203d13ec6
https://doi.org/10.1016/j.dam.2014.07.007
https://doi.org/10.1016/j.dam.2014.07.007
Autor:
Patrick Ali
Publikováno v:
Discrete Mathematics. 313:1322-1326
Let G be a connected graph of order p , and let S be a nonempty set of vertices of G . Then the Steiner distance d ( S ) of S is the minimum size of a connected subgraph of G whose vertex set contains S . If n is an integer, 2 ≤ n ≤ p , the Stein
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::678968b7192879f2ce9f9855737e4859
https://doi.org/10.1016/j.disc.2013.02.013
https://doi.org/10.1016/j.disc.2013.02.013