نتایج جستجو برای: f index

تعداد نتایج: 689960  

خیری, امین, عبداالله زاده, شرمین, فیروزه مقدم, اسحاق, مرتضوی, حامد, خدادوستان, امین , عبدالصمدی, حمیدرضا , واحدی, محمد ,

Background & Objective: Oral health problems of chronic renal failure patients can compromise systemic health. The purpose of this study was to investigate the dental and periodontal status of patients on regular hemodialysis (HD) maintenance therapy and the effect of duration of HD on oral health. Methods & Materials: In this historical cohort study 65 HD patients and 65 healthy people we...

Journal: :The Egyptian Journal of Neurology, Psychiatry and Neurosurgery 2020

Journal: :American journal of kidney diseases : the official journal of the National Kidney Foundation 2006
Yen-Cheng Chen Szu-Chun Hung Der-Cherng Tarng

BACKGROUND The diagnostic power of the transferrin receptor-ferritin (TfR-F) index for identification of iron responsiveness in long-term hemodialysis (HD) patients compared with the routine markers recommended by the current US and European guidelines was appraised. METHODS Initially, 121 long-term HD patients with a serum ferritin level less than 800 microg/L and on recombinant erythropoiet...

Journal: :CoRR 2017
Nilanjan De

The forgotten topological index or F-index of a graph is defined as the sum of cubes of the degree of all the vertices of the graph. In this paper we study the F-index of four operations related to the lexicographic product on graphs which were introduced by Sarala et al. [D. Sarala, H. Deng, S.K. Ayyaswamya and S. Balachandrana, The Zagreb indices of graphs based on four new operations related...

2017
David Woodruff Xiaofei Shi

And recall that the INDEX model has the lower bound for deterministic communication complexity: CCδ(INDEX) ≥ I(M ;X|R) ≥ n(1−H(δ)), where R is the shared common random string. We need a lower bound when conditioning on R for our earlier Gap-Hamming lower bound, which was a reduction from INDEX using the shared common random string R. Definition. Given (X,Y ) ∼ μ, the μ-distributional communicat...

Journal: :Networks 2010
Stéphane Bessy Clément Lepelletier

Maňuch and Stacho [7] introduced the problem of designing f -tolerant routings in optical networks, i.e., routings which still satisfy the given requests even if f failures occur in the network. In this paper, we provide f -tolerant routings in complete and complete balanced bipartite optical networks, optimal according to two parameters: the arc-forwarding index and the optical index. These co...

Journal: :Complex & Intelligent Systems 2022

Abstract The molecular descriptors are a useful tool in the spectral graph, chemistry and several fields of mathematics. edge F-index is proposed for fuzzy graphs (FGs) here. Bounds this index calculated FGs. FG has been investigated given set vertices as having maximum F-index. Some relations with second Zagreb hyper-Zagreb established. For an isomorphic FGs, it shown that value same. some ope...

Journal: :AKCE International Journal of Graphs and Combinatorics 2020

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید