Zobrazeno 1 - 10
of 13
pro vyhledávání: '"BIBIN K JOSE"'
Autor:
BIBIN K JOSE
Publikováno v:
Baghdad Science Journal, Vol 20, Iss 1(SI) (2023)
Let A ⊆ V(H) of any graph H, every node w of H be labeled using a set of numbers; , where d(w,v) denotes the distance between node w and the node v in H, known as its open A-distance pattern. A graph H is known as the open distance-pattern uniform
Externí odkaz:
https://doaj.org/article/eb7742dbe37548cdb8cd238d2e240cf0
Autor:
Dr. Araddhana Manisha Arvind Deshmukh, Dr. Sumegh Shrikant Tharewal, Dr. Ravinder S Saini, Dr. Bibin K Jose
Technology related to artificial intelligence have the potential to change both the clinical care that is provided to patients and the administrative processes that are followed within healthcare delivery organisations (HDO). The ever-increasing amou
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1585ec9c4d9faec3fe766d068dcad727
Autor:
P. Revathi, Merin George, Bessy Mary Philip, Sutheertha S. Nair, Bibin K. Jose, Elsy Shereena, Reena Ittyachan, T. Balakrishnan, D. Sajan
We herein record the synthesis as well as the results of our investigations on the structure as well as properties - thermal, mechanical, surface and nonlinear optical (NLO) - of semiorganic bisglycine lithium perchlorate (BGLP) single crystals. BGLP
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::430a27e5c3125b9bc756d5b25a7c7ff4
https://doi.org/10.21203/rs.3.rs-2837383/v1
https://doi.org/10.21203/rs.3.rs-2837383/v1
Autor:
Sathanapriya M, R. Prameela Devi, C. Sandhya, Anil Pokuru, T. HabeeburRahman, Bibin K Jose, Samata Gadde
Publikováno v:
2022 International Conference on Edge Computing and Applications (ICECAA).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7b6cdb635131358f262222d925243479
https://doi.org/10.1109/icecaa55415.2022.9936473
https://doi.org/10.1109/icecaa55415.2022.9936473
Autor:
S. Venkatachalam, Peddinti Neeraja, S. Kavitha, B. Rajasekaran, G. Santhosh Kumar, Bibin K Jose
Publikováno v:
2022 4th International Conference on Inventive Research in Computing Applications (ICIRCA).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bbd0a3a6cd8eb485642d9a227d434019
https://doi.org/10.1109/icirca54612.2022.9985712
https://doi.org/10.1109/icirca54612.2022.9985712
Autor:
Karrar Hussain, D. Vanathi, Bibin K Jose, S Kavitha, Bhuvaneshwari Yogesh Rane, Harpreet Kaur, C. Sandhya
Publikováno v:
2022 International Conference on Applied Artificial Intelligence and Computing (ICAAIC).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c3407b77299b8f90ba1b0624b312bb2d
https://doi.org/10.1109/icaaic53929.2022.9792664
https://doi.org/10.1109/icaaic53929.2022.9792664
Publikováno v:
Journal of the Indian Chemical Society. 99:100624
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0f5bfade675eebeab1d5e34d231a2e47
https://doi.org/10.1016/j.jics.2022.100624
https://doi.org/10.1016/j.jics.2022.100624
Publikováno v:
PROCEEDINGS OF INTERNATIONAL CONFERENCE ON ADVANCES IN MATERIALS RESEARCH (ICAMR - 2019).
The betweenness centrality of a graph measures the tendency of a single vertex to be more central than all other vertices in the graph. It is based on differences between the centrality of the most central vertex and that of all others. In many real
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5cea22d0c889c1a04c68f0a0fe75e971
https://doi.org/10.1063/5.0016847
https://doi.org/10.1063/5.0016847
Publikováno v:
Discrete Applied Mathematics. 161:1859-1867
A subset S of the vertex set of a hypergraph H is called a dominating set of H if for every vertex v not in S there exists u@?S such that u and v are contained in an edge in H. The minimum cardinality of a dominating set in H is called the domination
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0f87c9a6be708347285c1975620fcf37
https://doi.org/10.1016/j.dam.2013.02.009
https://doi.org/10.1016/j.dam.2013.02.009
Autor:
Bibin K. Jose, Zsolt Tuza
Publikováno v:
Applicable Analysis and Discrete Mathematics. 3:347-358
We solve several conjectures and open problems from a recent paper by Acharya [2]. Some of our results are relatives of the Nordhaus-Gaddum theorem, concerning the sum of domination parameters in hypergraphs and their complements. (A dominating set i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::329b4073579df4748258e9ed492cd1d4
https://doi.org/10.2298/aadm0902347j
https://doi.org/10.2298/aadm0902347j