نتایج جستجو برای: based indices
تعداد نتایج: 2994558 فیلتر نتایج به سال:
Eiman Zargaran, MD, MHSc, Lauren Adolph, Nadine Schuurman, PhD, Larissa Roux, MD, PhD, Damon Ramsey, MD, Richard Simons, MB, BChir, Richard Spence, MD, Andrew J. Nicol, MD, PhD, Pradeep Navsaria, MD, Juan Carlos Puyana, MD, Neil Parry, MD, Lynne Moore, PhD, Michel Aboutanos, MD, MPH, Natalie Yanchar, MD, Tarek Razek, MD, Chad G. Ball, MD, MSc, and S. Morad Hameed, MD, MPH, for the Trauma Associ...
Cerebral language lateralization can be assessed in several ways. In healthy subjects, functional MRI (fMRI) during performance of a language task has evolved to be the most frequently applied method. Functional transcranial Doppler (fTCD) may provide a valid alternative, but has been used rarely. Both techniques have their own strengths and weaknesses and as a result may be applied in differen...
This paper compares the Portuguese and Bulgarian consumer price indices (CPI) and attempts to identify some areas in which the CPI compilation methodology could be improved in the two countries. This work is organised into six sections. The first section briefly describes the organisational structure on which the production of the CPI is based in the two countries. The second section focuses on...
Let $G$ be a graph and let $m_{ij}(G)$, $i,jge 1$, be the number of edges $uv$ of $G$ such that ${d_v(G), d_u(G)} = {i,j}$. The {em $M$-polynomial} of $G$ is introduced with $displaystyle{M(G;x,y) = sum_{ile j} m_{ij}(G)x^iy^j}$. It is shown that degree-based topological indices can be routinely computed from the polynomial, thus reducing the problem of their determination in each particular ca...
Let $G$ be a connected graph, and let $D[G]$ denote the double graph of $G$. In this paper, we first derive closed-form formulas for different distance based topological indices for $D[G]$ in terms of that of $G$. Finally, as illustration examples, for several special kind of graphs, such as, the complete graph, the path, the cycle, etc., the explicit formulas for some distance based topologica...
let $g$ be a graph and let $m_{ij}(g)$, $i,jge 1$, be the number of edges $uv$ of $g$ such that ${d_v(g), d_u(g)} = {i,j}$. the {em $m$-polynomial} of $g$ is introduced with $displaystyle{m(g;x,y) = sum_{ile j} m_{ij}(g)x^iy^j}$. it is shown that degree-based topological indices can be routinely computed from the polynomial, thus reducing the problem of their determination in each particular ca...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید