let z2 = {0, 1} and g = (v ,e) be a graph. a labeling f : v → z2 induces an edge labeling f* : e →z2 defined by f*(uv) = f(u).f (v). for i ε z2 let vf (i) = v(i) = card{v ε v : f(v) = i} and ef (i) = e(i) = {e ε e : f*(e) = i}. a labeling f is said to be vertex-friendly if | v(0) − v(1) |≤ 1. the vertex balance index set is defined by {| ef (0) − ef (1) | : f is vertex-friendly}. in this paper ...

Magic tee is a widely used component in microwave systems; the four arms of a conventional magic tee direct at four different directions, which occupy much space and give inconveniences to the assemblage of a system. In this paper, a waveguide narrow-wall slot directional coupler and an E-plane dielectric loaded waveguide phase shifter are used to make up of a magic tee with four arms in the sa...

H. Bartko , A. Biland , E. Bisesi , D. Elsässer , P. Flix , P. Häfliger , M. Mariotti , S. Stark , W. Wittek for the MAGIC collaboration (a) Max Planck Institute for Physics, Munich Germany (b) ETH Zurich, Switzerland (c) University of Udine and INFN Trieste, Italy (d) University of Wüerzburg, Germany (d) Institut de Fisica d Altes Energies, Edifici Cn Universitat Autonoma de Barcelona, Bellate...

The study of valuations of graphs is a relatively young part of graph theory. In this article we survey what is known about certain graph valuations, that is, labeling methods: antimagic labelings, edge-magic total labelings and vertex-magic total labelings.

Enomoto, Llado, Nakamigawa and Ringel (1998) defined the concept of a super (a, 0)-edge-antimagic total labeling and proposed the conjecture that every tree is a super (a, 0)-edge-antimagic total graph. In the support of this conjecture, the present paper deals with different results on super (a, d)-edge-antimagic total labeling of subdivided stars for d ∈ {0, 1, 2, 3}.

As a natural extension of previously defined graph labelings, we introduce in this paper a new magic labeling whose evaluation is based on the neighbourhood of a vertex. We define a 1-vertex-magic vertex labeling of a graph with v vertices as a bijection f taking the vertices to the integers 1, 2, . . . , v with the property that there is a constant k such that at any vertex x, ∑ y∈N(x) f(y) = ...

An experiment was conducted in the horticultural farm at Sher-e-Bangla Agricultural University, Dhaka to evaluate Mulch practices on Growth and yield of four Lisianthus germplasm. The consisted treatments (Mo: Control, Ms: Straw mulch, Mc: Cocodust Mbp: Black polythene mulch) germplasms (V1: Arena Type Pure White,V2: Double White, V3: Light Pink, V4:Super Magic Blue), laid out a Randomized Comp...

This study examined the average surface roughness (Ra, microm) of 2 microfilled (Durafill and Perfection), 1 hybrid (Filtek Z250) and 2 packable composite resins (Surefil and Fill Magic), before (baseline) and after eight different finishing and polishing treatments. The surface roughness was assessed using a profilometer. Ten specimens of each composite resin were randomly subjected to one of ...