نتایج جستجو برای: odd mean labeling
تعداد نتایج: 664567 فیلتر نتایج به سال:
Consider a graph G with |V (G)| = p and |E(G)| q let f : V (G) → {k, k + 1, 2, . − 1}} be an injective function. The induced edge labeling ∗ for vertex is defined by (e) all e uv ∈ E(G) bijective. If f(V (G)) ∪ {f E(G)} , 1}, then called k-super cube root mean labeling. such exists, graph. In this paper, I introduce prove the existence of to graphs viz., triangular snake Tn, double D(Tn), Quadr...
The concept of fuzzy magic labeling is introduced.Fuzzy magic labeling for some graphs like path, cycle and star graph are defined. It is proved that, every fuzzy magic graph is a fuzzy labeling graph, but the converse is not true. And we show that the removal of a fuzzy bridge from a fuzzy magic graph G, such that G* is a cycle with odd number of nodes is a fuzzy magic graph.And also some prop...
Background: Bacterial sepsis is highly prevalent among premature infants. Amikacin is an antibiotic widely recommended for the treatment of neonatal sepsis, one of the consequences of which might be nephrotoxicity. The present study aimed to compare the efficacy and nephrotoxicity of multiple daily dosing (MDD) and once-daily dosing (ODD) of amikacin in preterm infants suspected of sepsis. Met...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید