نتایج جستجو برای: روش e v
تعداد نتایج: 1633869 فیلتر نتایج به سال:
An H-magic labeling in a H-decomposable graph G is a bijection f : V (G) ∪ E(G) → {1, 2, ..., p + q} such that for every copy H in the decomposition, ∑νεV (H) f(v) + ∑νεE (H) f(e) is constant. f is said to be H-E-super magic if f(E(G)) = {1, 2, · · · , q}. A family of subgraphs H1,H2, · · · ,Hh of G is a mixed cycle-decomposition of G if every subgraph Hi is isomorphic to some cycle Ck, for k ≥...
% .3 +4 % . .+ %/ 01" ,-" ( )*+ -" )*+ #$ >4 % (! .5+ .3 6 7 !# 87 9: 8; 8<" .= c % " -7?" @ a!" b 6 6!! ," #% b !" (i 1) .3 (! .5+ 9d" e!f 9= ." g)*+ #$ &/"< p c #$ m5n" b c >o1 . k b#0 l &t gv5n" #$ % 50 &t % 50 g&t % 100) #$ m5n" e + w" x5 y4 z7[ "% . (#$ % 100 g" @ #$ n % 4 2 31" cropwat " ] . % " % . 6 k a17 % #+ 8$ g; e!f 9= a % m5n" b / &" `. !ib ....
let g = (v, e) be a simple graph. hosoya polynomial of g isd(u,v)h(g, x) = {u,v}v(g)x , where, d(u ,v) denotes the distance between vertices uand v. as is the case with other graph polynomials, such as chromatic, independence anddomination polynomial, it is natural to study the roots of hosoya polynomial of a graph. inthis paper we study the roots of hosoya polynomials of some specific graphs.
Suppose $X$ is a simple graph. The $X-$join $Gamma$ of a set ofcomplete or empty graphs ${X_x }_{x in V(X)}$ is a simple graph with the following vertex and edge sets:begin{eqnarray*}V(Gamma) &=& {(x,y) | x in V(X) & y inV(X_x) },\ E(Gamma) &=& {(x,y)(x^prime,y^prime) | xx^prime in E(X) or else x = x^prime & yy^prime in E(X_x)}.end{eqnarray*}The $X-$join graph $Gamma$ is said to be re...
Let G(V,E) be a graph with p vertices and q edges. A graph G is said to have an odd mean labeling if there exists a function f : V (G) → {0, 1, 2,...,2q - 1} satisfying f is 1 - 1 and the induced map f* : E(G) → {1, 3, 5,...,2q - 1} defined by f*(uv) = (f(u) + f(v))/2 if f(u) + f(v) is evenf*(uv) = (f(u) + f(v) + 1)/2 if f(u) + f(v) is odd is a bijection. A graph that admits an odd mean labelin...
Definition 1.3 (Subgraph). Let G = (V, E) and H = (V ′, E′) be two graphs. H is a subgraph of G if V ′ ⊆ V and E′ ⊆ E. H is a proper subgraph is V ′ ( V or E′ ( E. Definition 1.4 (Vertex Induced Subgraph). Let G = (V, E) and V ′ ⊆ V . The subgraph of G induced by V is a graph H = (V ′, E′) where E′ = {{u, v} ∈ E|u ∈ V ′, v ∈ V ′}. Definition 1.5 (Edge Induced Subgraph). Let G = (V, E) and E′ ⊆ ...
In this work, the concentrations of the potentially toxic elements in stream sediments in SE Nigeria were assessed for pollution monitoring in mining, quarrying, and farming areas. The levels of iron, molybdenum, vanadium, copper, lead, zinc, nickel, cobalt, manganese, chromium, barium, and beryllium were determined. The concentrations of the elements were in the order of Fe > Ba > Mn > Cr > Zn...
Let $G$ be a graph with $p$ vertices and $q$ edges. The graph $G$ is said to be a super pair sum labeling if there exists a bijection $f$ from $V(G)cup E(G)$ to ${0, pm 1, pm2, dots, pm (frac{p+q-1}{2})}$ when $p+q$ is odd and from $V(G)cup E(G)$ to ${pm 1, pm 2, dots, pm (frac{p+q}{2})}$ when $p+q$ is even such that $f(uv)=f(u)+f(v).$ A graph that admits a super pair sum labeling is called a {...
and Applied Analysis 3 Let EI and EB be the set of interior edges and boundary edges of Th, respectively. Let E EI ∪ EB. Denote by v the restriction of v to Ki. Let e eij ∈ EI with i > j. Then we denote the jump v and the average {v} of v on e by v |e v ∣ ∣ ∣ e −v ∣ ∣ ∣ e , {v}|e 1 2 ( v ∣ ∣ ∣ e v ∣ ∣ ∣ e ) . 2.4 If e ei ∈ EB, we denote v and {v} of v on e by v |e {v}|e v ∣ ∣ ∣ e . 2.5
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید