نتایج جستجو برای: subdivison of star

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

2017
Sathish Narayanan Ebrahim Salehi

Recently three prime cordial labeling behavior of path, cycle, complete graph, wheel, comb, subdivison of a star, bistar, double comb, corona of tree with a vertex, crown, olive tree and other standard graphs were studied. Also four prime cordial labeling behavior of complete graph, book, flower were studied. In this paper, we investigate the four prime cordial labeling behavior of corona of wh...

vspace{0.2cm} Let $G$ be a graph and $f:V(G)rightarrow {1,2,3,.....left|V(G)right|}$ be a bijection. Let $p_{uv}=f(u)f(v)$ and\ $ d_{uv}= begin{cases} left[frac{f(u)}{f(v)}right] ~~if~~ f(u) geq f(v)\ \ left[frac{f(v)}{f(u)}right] ~~if~~ f(v) geq f(u)\ end{cases} $\ for all edge $uv in E(G)$. For each edge $uv$ assign the label $1$ if $gcd (p_{u...

Journal: :Proceedings of the American Mathematical Society 1958

Journal: :journal of algorithms and computation 0
r. ponraj department of mathematics, sri paramakalyani college,alwarkurichi-627 412, india s. sathish narayanan department of mathematics, sri paramakalyani college,alwarkurichi-627 412, india

a graph g = (v,e) with p vertices and q edges is said to be a total mean cordial graph if there exists a function f : v (g) → {0, 1, 2} such that f(xy) = [(f(x)+f(y))/2] where x, y ∈ v (g), xy ∈ e(g), and the total number of 0, 1 and 2 are balanced. that is |evf (i) − evf (j)| ≤ 1, i, j ∈ {0, 1, 2} where evf (x) denotes the total number of vertices and edges labeled with x (x = 0, 1, 2). in thi...

Journal: :bulletin of the iranian mathematical society 2011
p. sahandi

let $d$ be an integral domain and $star$ a semistar operation stable and of finite type on it. we define the semistar dimension (inequality) formula and discover their relations with $star$-universally catenarian domains and $star$-stably strong s-domains. as an application, we give new characterizations of $star$-quasi-pr"{u}fer domains and um$t$ domains in terms of dimension ine...

2004
Vid Domiter

This paper presents an algorithm for obtaining a constrained Delaunay triangulation from a given planar graph. The main advantage towards other algorithms is that I use an efficient Žalik’s algorithm, using a plane subdivison for obtaining a Delaunay triangulation. It is used for insertion of points into existing triangulation. The other part of algorithm presents a method for inserting edges, ...

Journal: :Geophysical Journal of the Royal Astronomical Society 2007

2001
TOM DUCHAMP

We present a method for estimating functions on topologically and/or geometrically complex surfaces from possibly noisy observations. Our approach is an extension of spline smoothing, using a Þnite element method. The paper has a substantial tutorial component: we start by reviewing smoothness measures for functions deÞned on surfaces, simplicial surfaces and differentiable structures on such s...

2008
Philipp Grohs PHILIPP GROHS

Nonlinear subdivision schemes that operate on manifolds are of use whenever manifold valued data have to be processed in a multiscale fashion. This paper considers the case where the manifold is a Lie group and the nonlinear subdivision schemes are derived from linear interpolatory ones by the so-called log-exp analogy. The main result of the paper is that a multivariate interpolatory Lie group...

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

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