نتایج جستجو برای: graphoidal labeling
تعداد نتایج: 57738 فیلتر نتایج به سال:
Labeling of genetically modified (GM) foods has increasingly become a topic at the consumer and policymaker level. Using an online survey that included conjoint analysis experiment, preference for GM labeling on both fresh tomatoes tomato plants was evaluated. Retailer (farmers market, grocery stores, mass merchandisers) sales quantity sold were simulated to examine impact introducing as well c...
This report describes the detailed procedures for Western blot analysis using fluorescent antibodies. After electrophoresis and subsequent electroblotting, the fluorescent-labeled antibodies were visible upon ultraviolet illumination of the polyvinylidene fluoride (PVDF) membranes and could then be photographed to give an accurate record of the blots. Fluorescent labeling allows for photographi...
We consider biobjective shortest path problems in networks with fuzzy arc lengths. Considering the available studies for single objective shortest path problems in fuzzy networks, using a distance function for comparison of fuzzy numbers, we propose three approaches for solving the biobjective prob- lems. The rst and second approaches are extensions of the labeling method to solve the sing...
In this paper, we focus on one type of labeling is called range labeling, have introduced for certain graphs as Pz, Cz, Sy,z(Double star), sun graph and some trees.
In this paper, a modified segmentation algorithm for printed Farsi words is presented. This algorithm is based on a previous work by Azmi that uses the conditional labeling of the upper contour to find the segmentation points. The main objective is to improve the segmentation results for low quality prints. To achieve this, various modifications on local baseline detection, contour labeling an...
For any h in N , a graph G = (V, E) is said to be h-magic if there exists a labeling l: E(G) to Z_{h}-{0} such that the induced vertex set labeling l^{+: V(G) to Z_{h}} defined by l^{+}(v)= Summation of l(uv)such that e=uvin in E(G) is a constant map. For a given graph G, the set of all for which G is h-magic is called the integer-magic spectrum of G and is denoted by IM(G). In this paper, the ...
An injective map f : E(G) → {±1, ±2, · · · , ±q} is said to be an edge pair sum labeling of a graph G(p, q) if the induced vertex function f*: V (G) → Z − {0} defined by f*(v) = (Sigma e∈Ev) f (e) is one-one, where Ev denotes the set of edges in G that are incident with a vetex v and f*(V (G)) is either of the form {±k1, ±k2, · · · , ±kp/2} or {±k1, ±k2, · · · , ±k(p−1)/2} U {k(p+1)/2} accordin...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید