Zobrazeno 1 - 4
of 4
pro vyhledávání: '"S. B. Lokesh"'
Autor:
Ranjitha Gangadharaiah, Devika Rani Duggappa, Sudheesh Kannan, S B Lokesh, Karuna Harsoor, K M Sunanda, S S Nethra
Publikováno v:
Indian Journal of Anaesthesia, Vol 61, Iss 11, Pp 916-922 (2017)
Introduction: Co-administration of phenylephrine prevents oxytocin-induced hypotension during caesarean section under spinal anaesthesia (SA), but higher doses cause reflex bradycardia. This study compares the effects of co-administration of two diff
Externí odkaz:
https://doaj.org/article/5654370d12804a5b98248e29ba01500f
Publikováno v:
Indian Journal of Pure and Applied Mathematics. 50:451-460
A graph is called uniform central (UC) if all its central vertices have the same set of eccentric vertices. It is proved that if G is a UC graph with radius at least 3, then substituting a central vertex u of G with an arbitrary graph H and connectin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b8f15cfb2344a4fbdccc500bfe6a0c70
https://doi.org/10.1007/s13226-019-0337-4
https://doi.org/10.1007/s13226-019-0337-4
Autor:
Narayankar, Kishori P.1 kishori_pn@yahoo.co.in, S. B., Lokesh1 sbloki83@gmail.com, Mathad, Veena2 veena_mathad@rediffmail.com
Publikováno v:
International Journal of Mathematical Combinatorics. Sep2015, Vol. 3, p105-115. 11p.
Publikováno v:
Taiwanese J. Math. 18, no. 2 (2014), 463-471
The center $C(G)$ and the periphery $P(G)$ of a connected graph $G$ consist of the vertices of minimum and maximum eccentricity, respectively. Almost-peripheral (AP) graphs are introduced as graphs $G$ with $|P(G)| = |V(G)| - 1$ (and $|C(G)| = 1$). A
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e1277fba66a3131268ade301ff8b78c6
https://doi.org/10.11650/tjm.18.2014.3267
https://doi.org/10.11650/tjm.18.2014.3267