Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Dhruv Medarametla"'
Publikováno v:
Applied Mathematics and Computation. 313:384-391
An edge-colored path is called properly colored if no two consecutive edges have the same color. An edge-colored graph is called properly connected if, between every pair of vertices, there is a properly colored path. Moreover, the proper distance be
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ff3b6adf49102a02281a6cc097845edb
https://doi.org/10.1016/j.amc.2017.05.065
https://doi.org/10.1016/j.amc.2017.05.065
Autor:
Ahmed Kabore, Evans Afriyie-Gyawu, Nicolas Meda, Melissa Hester, Moussa Aziz Wonadé Sié, Dhruv Medarametla, James Awuah, Andrew R. Hansen, Ashley D. Walker
Publikováno v:
Pan African Medical Journal; Vol. 34 No. 1 (2019)
The Pan African Medical Journal
The Pan African Medical Journal
Introduction:substance abuse is an important public health issue affecting West Africa; however, there is currently a dearth of literature on the actions needed to address it. The aim of this study was to assess the risks and protective factors of su
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::545ca5aeb9dfa763cbe396fb0c95708b
https://www.ajol.info/index.php/pamj/article/view/212242
https://www.ajol.info/index.php/pamj/article/view/212242
Publikováno v:
Parallel Processing Letters. 25:1550006
The class of 2-bijective connection networks (2BC networks) is defined recursively as follows: Let [Formula: see text] and for [Formula: see text], let [Formula: see text] be the set of all graphs that can be constructed by taking two (possibly the s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::690dde1dc3fdfbc778ac280d93b29b22
https://doi.org/10.1142/s0129626415500061
https://doi.org/10.1142/s0129626415500061