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

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

2004
SAMUEL S. GIDDING AMNON ROSENTHAL ALBERT P. ROCCHINI

The Valsalva maneuver was performed during cardiac catheterization in 9 patients who had undergone a Fontan operation (Fontan group) and in 10 control subjects. The Fontan group had higher right atrial (RA) pressure (16 f 1 vs 4 f 0.5 mm Hg, p <O.OOi), lower cardiac index (2.5 f 0.1 vs 3.7 f 0.2 liters/min/m*, p <0.05), lower stroke index (32 f 2 vs 44 f 2 ml/beat/m*, p <0.05), and higher syste...

Journal: :IEEE Transactions on Vehicular Technology 2022

In a Fog Radio Access Network (F-RAN), fog access points (F-APs) are equipped with caches that can store popular files during off-peak hours. Besides, they densely deployed to have overlapping radio coverage so requested be delivered cooperatively using beamforming. The bottleneck of the network is typically in bandwidth-limited wireless fronthaul, which connects cloud server F-APs. This work s...

Journal: :Int. J. Comput. Math. 2015
Stefan Glock

Our motivation is the question how similar the f -colouring problem is to the classic edge-colouring problem, particularly with regard to graph parameters. In 2010, Zhang, Yu, and Liu [9] gave a new description of the f -matching polytope and derived a formula for the fractional f -chromatic index, stating that the fractional f -chromatic index equals the maximum of the fractional maximum f -de...

2015
Jia Fang Ming-Sheng Liu Yu-Zhou Guan Bo Cui Li-Ying Cui

BACKGROUND In amyotrophic lateral sclerosis (ALS), repeater F waves are increased. Accurate assessment of repeater F waves requires an adequate sample size. METHODS We studied the F waves of left ulnar nerves in ALS patients. Based on the presence or absence of pyramidal signs in the left upper limb, the ALS patients were divided into two groups: One group with pyramidal signs designated as P...

Journal: :Ars Comb. 2009
Ebrahim Salehi Shipra De

For a graph G = (V,E) and a binary labeling f : V (G) → Z2, let vf (i) = |f−1(i)|. The labling f is said to be friendly if |vf (1)−vf (0)| ≤ 1. Any vertex labeling f : V (G) → Z2 induces an edge labeling f∗ : E(G) → Z2 defined by f∗(xy) = |f(x)− f(y)|. Let ef (i) = |f∗−1(i)|. The friendly index set of the graph G, denoted by FI(G), is defined by FI(G) = {|ef (1)− ef (0)| : f is a friendly verte...

Journal: :CoRR 2016
Ruhul Amin Sk. Md. Abu Nayeem

The aim of this work is to investigate the F-index and F-coindex of the line graphs of the cycle graphs, star graphs, tadpole graphs, wheel graphs and ladder graphs using the subdivision concepts. F-index of the line graph of subdivision graph of square grid graph, 2D-lattice, nanotube and nanotorus of TUC4C8[p, q] are also investigated here.

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

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