نتایج جستجو برای: z_k magic labeling
تعداد نتایج: 68020 فیلتر نتایج به سال:
Let $P$ be a complex polynomial of the form $P(z)=zdisplaystyleprod_{k=1}^{n-1}(z-z_{k})$,where $|z_k|ge 1,1le kle n-1$ then $ P^prime(z)ne 0$. If $|z|
The magic is something with a subtle source, which is not seen with eye, and its source cannot be found in a normal way. The magic has a variety of forms that have harmful and non-harmful effects. The wizards use the latter one to deceive people. The motive for choosing this topic among other ones is that some people resort to the magic for different reasons such as: outbreaking demons for the ...
let $p$ be a complex polynomial of the form $p(z)=zdisplaystyleprod_{k=1}^{n-1}(z-z_{k})$,where $|z_k|ge 1,1le kle n-1$ then $ p^prime(z)ne 0$. if $|z|
Three different techniques (adiabatic passage Hartman-Hahn cross-polarization, optimal control designed pulses, and EXPORT) are compared for transferring (15)N magnetization to (13)C in solid-state NMR experiments under magic-angle-spinning conditions. We demonstrate that, in comparison to adiabatic passage Hartman-Hahn cross-polarization, optimal control transfer pulses achieve similar or bett...
General methods for the construction of magic squares of any order have been searched for centuries. Several " standard strategies " have been found for this purpose, such as the " knight movement " , or the construction of bordered magic squares, which played an important role in the development of general methods. What we try to do here is to give a general and comprehensive approach to the c...
A magic labelling of a set system is a labelling of its points by distinct positive integers so that every set of the system has the same sum, the magic sum. Examples are magic squares (the sets are the rows, columns, and diagonals) and semimagic squares (the same, but without the diagonals). A magilatin labelling is like a magic labelling but the values need be distinct only within each set. W...
mean labelings are a type of additive vertex labeling. this labeling assigns non-negative integers to the vertices of a graph in such a way that all edge-weights are different, where the weight of an edge is defined as the mean of the end-vertex labels rounded up to the nearest integer. in this paper we focus on mean labelings of some graphs that are the result of the corona operation. in parti...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید