Zobrazeno 1 - 10
of 553
pro vyhledávání: '"M, Venkatachalam"'
Publikováno v:
Measurement: Sensors, Vol 30, Iss , Pp 100932- (2023)
Lung cancer is a dangerous illness in the modern world. Lung cancer diagnosis requires a more thorough investigation than other disease processes since it affects both men and women and has a higher fatality rate. The law currently mandates the creat
Externí odkaz:
https://doaj.org/article/0241d5777697476e9831916ec43c6d30
Autor:
Annie M. Abraham, Audrie A. Chavez, Aardhra M. Venkatachalam, Samarpita Sengupta, DaiWai M. Olson, Kathleen R. Bell, Nneka L. Ifejika
Publikováno v:
BMC Medical Education, Vol 22, Iss 1, Pp 1-8 (2022)
Abstract Background The 36-month Physical Medicine and Rehabilitation (PM&R) or Physiatry residency provides a number of multidisciplinary clinical experiences. These experiences often translate to novel research questions, which may not be pursued b
Externí odkaz:
https://doaj.org/article/85167396f2b449d4833295dee40f8b15
Publikováno v:
AIMS Mathematics, Vol 6, Iss 2, Pp 1470-1496 (2021)
In this paper, it is explicitly determined the r-dynamic chromatic number of the direct product of any given path with either a complete graph or a wheel graph. Illustrative examples are shown for each one of the cases that are studied throughout the
Externí odkaz:
https://doaj.org/article/c9f67b95a9194f09b587f7ce9bdce381
Autor:
Amna A. Butt, Folefac D. Atem, Sonja E. Stutzman, Venkatesh Aiyagari, Aardhra M. Venkatachalam, DaiWai M. Olson, Shoji Yokobori
Publikováno v:
Journal of Neurocritical Care, Vol 14, Iss 1, Pp 29-35 (2021)
Background Glasgow Coma Scale (GCS) and the pupillary light reflex (PLR) are important prognostic tools for traumatic brain injury (TBI). This study compared the predictability of GCS, GCS plus manual PLR (GCS-P), GCS plus Neurological Pupil index (G
Externí odkaz:
https://doaj.org/article/f4a713f279a24e7facf4a0b95d00ea65
Publikováno v:
AIMS Mathematics, Vol 5, Iss 6, Pp 6496-6520 (2020)
In this paper, we determine explicitly the r-dynamic chromatic number of the direct product of any given path with either a path or a cycle. Illustrative examples are shown for each one of the cases that are studied throughout the paper.
Externí odkaz:
https://doaj.org/article/03c72b33aa774e6fb0abf1bcd3b54a1f
Publikováno v:
AIMS Mathematics, Vol 5, Iss 5, Pp 4546-4562 (2020)
This paper deals with the r-dynamic chromatic number of the subdivision-edge corona of a path and exactly one of the following nine types of graphs: a path, a cycle, a wheel, a complete graph, a complete bipartite graph, a star, a double star, a fan
Externí odkaz:
https://doaj.org/article/c8b8d1cfc98f41af94b3252db004f4ed
Publikováno v:
Neutrosophic Sets and Systems, Vol 31, Pp 172-178 (2020)
Smarandache introduced the concept of Neutrosophic which deals with membership, non-membership and indeterminacy values. Wang discussed the Single Valued Neutrosophic sets in 2010. Single Valued Neutrosophic graph was introduced by Broumi and in 20
Externí odkaz:
https://doaj.org/article/3402dec8638849399c7b3821a184c2da
Publikováno v:
Neutrosophic Sets and Systems, Vol 28, Pp 13-22 (2019)
Neutrosophic set was introduced by Smarandache in 1998. Due to some real time situation, decision makers deal with uncertainty and inconsistency to identify the best result. Neutrosophic concept helps to investigate the vague or indeterminacy values.
Externí odkaz:
https://doaj.org/article/56744baaed334089b5aa4e0aa4ef4927
Publikováno v:
CAUCHY: Jurnal Matematika Murni dan Aplikasi. 7:548-558
Let be a connected graph with vertex set and edge set . A bijection from to the set is a labeling of graph . The bijection is called rainbow antimagic vertex labeling if for any two edge and in path , where and . Rainbow antimagic coloring is a graph
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1d4dd3a6f62c8d81ad509891c5c3c67f
https://doi.org/10.18860/ca.v7i4.17471
https://doi.org/10.18860/ca.v7i4.17471
Publikováno v:
Heliyon, Vol 7, Iss 5, Pp e06991- (2021)
A function f with domain and range are respectively the edge set of graph G and natural number up to ke, and a function f with domain and range are respectively the vertex set of graph G and the even natural number up to 2kv are called a total k-labe
Externí odkaz:
https://doaj.org/article/ef2563dcebc64723a873337f2043784a