نتایج جستجو برای: vertex function

تعداد نتایج: 1247013  

Journal: :journal of algorithms and computation 0
p. jeyanthi govindammal aditanar college for women tiruchendur-628 215, tamil nadu, india t. saratha devi department of mathematics, g.venkataswamy naidu college, kovilpatti-628502,tamilnadu,india.

let g be a (p,q) graph. an injective map f : e(g) → {±1,±2,...,±q} is said to be an edge pair sum labeling if the induced vertex function f*: v (g) → z - {0} defi ned by f*(v) = σp∈ev f (e) is one-one where ev denotes the set of edges in g that are incident with a vertex 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} according a...

Journal: :journal of algorithms and computation 0
p. jeyanthi principal and head of the research centre,department of mathematics,govindammal aditanar college for women,tiruchendur,tamilnadu,india d. ramya department of mathematics, dr.sivanthi aditanar college of engineering, tiruchendur- 628 215, india. r. kalaiyarasi department of mathematics, dr.sivanthi aditanar college of engineering, tiruchendur- 628 215, india.

in this paper we define a new labeling called skolem odd difference mean labeling and investigate skolem odd difference meanness of some standard graphs. let g = (v,e) be a graph with p vertices and q edges. g is said be skolem odd difference mean if there exists a function f : v (g) → {0, 1, 2, 3, . . . , p + 3q − 3} satisfying f is 1−1 and the induced map f : e(g) → {1, 3, 5, . . . , 2q−1} d...

Journal: :journal of algorithms and computation 0
p. jeyanthi 1research center, department of mathematics, govindammal aditanar college for women, tiruchendur - 628 215, tamilnadu,india a. maheswari 2department of mathematics, kamaraj college of engineering and technology, virudhunagar, india m. vijayalakshmi 3department of mathematics, dr.g.u. pope college of engineering, sawyerpuram, thoothukudi district, tamilnadu, india

let g be a graph with p vertices and q edges and a = {0, 1, 2, . . . , [q/2]}. a vertex labeling f : v (g) → a induces an edge labeling f∗ defined by f∗(uv) = f(u) + f(v) for all edges uv. for a ∈ a, let vf (a) be the number of vertices v with f(v) = a. a graph g is said to be vertex equitable if there exists a vertex labeling f such that for all a and b in a, |vf (a) − vf (b)| ≤ 1 and the in...

Journal: :The European Physical Journal C 2006

Journal: :Journal of High Energy Physics 2021

A bstract We propose a concrete form of vertex function, which we call O-vertex, for the intersection between an O5-plane and 5-brane in topological formalism, as extension work [1]. Using O-vertex it is possible to compute Nekrasov partition functions 5d theories realized on any web diagrams with O5-planes. apply our proposal webs pure SO( N ) gauge G 2 theory. The obtained results agree known...

Roman dominating function} on a digraph $D$ with vertex set $V(D)$ is a labeling$fcolon V(D)to {0, 1, 2}$such that every vertex with label $0$ has an in-neighbor with label $2$. A set ${f_1,f_2,ldots,f_d}$ ofRoman dominating functions on $D$ with the property that $sum_{i=1}^d f_i(v)le 2$ for each $vin V(D)$,is called a {em Roman dominating family} (of functions) on $D$....

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید