An entire-labeling (with positive integers) of a plane graph G is facedistinguishing, if w(f1) = w(f2) for any two adjacent faces f1 and f2 of G, where w(f) denote the sum of labels of the vertices and edges incident with f and also the label of f . In this paper we prove that every plane graph admits a face-distinguishing facially-proper entirelabeling with at most 12 labels. Moreover, we impr...

A curve γ in the plane is t-monotone if its interior has at most t− 1 vertical tangent points. A family of t-monotone curves F is simple if any two members intersect at most once. It is shown that if F is a simple family of n t-monotone curves with at least ǫn intersecting pairs (disjoint pairs), then there exists two subfamilies F1, F2 ⊂ F of size δn each, such that every curve in F1 intersect...

پژوهش حاضر به بررسی این مسأله می‌پردازد که چگونه نوعِ متد آموزشی می‌تواند بر میزان اضطراب زبانی دانشجویان زبان‌های خارجی تأثیر بگذارد. یک گروه 40 نفره از دختر و پسر در سطح پیش‌دانشگاهی به‌عنوان جامعه آماری انتخاب شدند. آموزش زبان فرانسه دو هفته‌ی اول، طریق گرامر-ترجمه انجام شد. پایان هفته تست تعیین مقیاس کلاس خارجی: FLCAS، بعمل آمد. دوم نوع رویکرد کنشی تغییر یافت. پس مجدداً فراگیران نتایج حاصله ن...

The concept of wireless power transfer for powering a low-power electronic circuit is demonstrated in this brief using novel rectifying-antenna (rectenna). proposed rectenna consisted by wide-band antenna and modified rectifier. bandwidth has been optimized to cover both the f1 = 868 MHz f2 915 UHF-RFID bands. A dual-band Class-F harmonic structure employed maximize PCE at low levels radio freq...

Let an injective function f from vertex set V of a graph G to the (F0, F1, F2, ..., Fn), where Fj is jth Fibonacci number (j=0, 1, n), said be cordial labeling if induced f* edge E {0,1} defined by (uv) = (f(u)+f(v)) (mod2) satisfies condition |ef(0)- ef(1) ≤ ef(0) edges with label 0 and 1. A which admits called graph.