Zobrazeno 1 - 10
of 32
pro vyhledávání: '"Arathi B"'
Publikováno v:
In Materials Today: Proceedings 2021 47 Part 1:381-386
Autor:
Rachana, N. D., Ranganath, Namrata, Pallavi, V. R., Shashidhar, G. S., Arathi, B. H., Gowda, V. B.
Publikováno v:
Journal of Clinical & Diagnostic Research; Jul2024, Vol. 18 Issue 7, p7-11, 5p
Autor:
SHOBHA, M. M.1, ARATHI, B. H.2, RANGANATH, NAMRATA3, SRIHARI, S. S.1 itsmedrshree@gmail.com, GOWDA, V. B.4
Publikováno v:
Journal of Clinical & Diagnostic Research. Feb2023, Vol. 17 Issue 2, p33-36. 4p.
Autor:
Arathi B H
Publikováno v:
MedPulse International Journal of Anesthesiology. 15:55-60
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2cc013cb7e58727aef96dd87cadb7946
https://doi.org/10.26611/10151525
https://doi.org/10.26611/10151525
Autor:
Arathi B, Shanthini A
Publikováno v:
International Journal of Advanced Computer Science and Applications. 13
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0f89318e2819be8cea92baa70ef9c3b2
https://doi.org/10.14569/ijacsa.2022.0131235
https://doi.org/10.14569/ijacsa.2022.0131235
Autor:
Shashwath S. Shetty, Arathi Bhat K
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 21, Iss 2, Pp 181-188 (2024)
Let GX be a graph obtained from a simple graph G by attaching a self-loop at each vertex of [Formula: see text]. The general extended adjacency matrix for the graph GX is defined and the bounds for the degree based energy of the graph GX are obtained
Externí odkaz:
https://doaj.org/article/a058e955f2b343dfb8c0bbc1b0755cca
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.
Autor:
LAKSHMAN, KAVITHA, MAMATHA, H. S., RACHANA, N. D., SUMITHA, C. S., RANGANATH, NAMRATA, GOWDA, V. B., ARATHI, B. H.
Publikováno v:
Journal of Clinical & Diagnostic Research; Jan2022, Vol. 16 Issue 1, p27-32, 6p
Autor:
Shashwath S. Shetty, Arathi Bhat K
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 20, Iss 3, Pp 326-331 (2023)
AbstractSome of the most comprehensively studied degree-based topological indices are the Zagreb indices. The first Zagreb index [Formula: see text] of a graph G is defined as the sum of squares of the degrees of the vertices. Let [Formula: see text]
Externí odkaz:
https://doaj.org/article/bcc8c712ae354b9e96278c79a41d7967
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 20, Iss 2, Pp 200-208 (2023)
AbstractStress is a centrality measure determined by the shortest paths passing through the given vertex. Noting that adjacency matrix playing an important role in finding the distance and the number of shortest paths between given pair of vertices,
Externí odkaz:
https://doaj.org/article/1df82be7e6e34dda95cc94098d11bcc4