نتایج جستجو برای: eccentricdistance sum

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

پایان نامه :دانشگاه آزاد اسلامی - دانشگاه آزاد اسلامی واحد یزد - دانشکده عمران 1392

مکان یابی مناطق مناسب جهت دفن مواد زاید از اقدامات مهم در فرآیند مدیریت پسماندهای جامد شهری است. هدف از این تحقیق مکان یابی مناطق مناسب جهت دفن مواد زاید با استفاده از تحلیل سلسله مراتبی( ahp) و منطق فازی با بهره گیری از نرم افزار expert choice است. نخست هر یک از عوامل موثر بر مکان یابی در منطقه مورد مطالعه از قبیل شیب، کاربری اراضی، لیتولوژی، فاصله از راه، فاصله از راه آهن، فاصله از آبراهه، فا...

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

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...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه محقق اردبیلی - دانشکده علوم ریاضی 1392

فرض کنید ‎$ x $‎ و ‎$ y $‎ فضاهای باناخ و ‎$ t $‎ یک عملگر خطی پیوسته از ‎$ x $‎ به ‎$ y $‎ باشد. اگر ‎$ y $‎ دارای توپولوژی راست باشد که توسط نرم آن القا شده می خواهیم نشان دهیم که یک توپولوژی موضعا محدب برای ‎$ x $‎ موجود است که عملگر ‎$ t $‎‎،‎ نسبت به آن ضعیف فشرده است. در نهایت تحت شرایط جدید می خواهیم بدانیم که اگر ‎$ sum x_{n} $‎ یک سری همگرای ضعیف در ‎$ x $‎ باشد آیا...

Journal: :Inf. Process. Lett. 2004
Heum-Geun Kang Jun-Ki Min Seok-Ju Chun Chin-Wan Chung

1995
JAMES E. BAUMGARTNER

We study the I-ultrafilters on ω, where I is a a collection of subsets of a set X , usually R or ω1. The I-ultrafilters usually contain the P -points, often as a small proper subset. We study relations between I-ultrafilters for various I, and closure of I-ultrafilters under ultrafilter sums. We consider, but do not settle, the question whether I-ultrafilters always exist.

Journal: :J. Comb. Theory, Ser. A 2015
Afshin Goodarzi

The clique vector c(G) of a graph G is the sequence (c1, c2, . . . , cd) in N, where ci is the number of cliques in G with i vertices and d is the largest cardinality of a clique in G. In this note, we use tools from commutative algebra to characterize all possible clique vectors of k-connected chordal graphs.

2009
BERNARDO M. ÁBREGO SILVIA FERNÁNDEZ-MERCHANT

For every pattern P , consisting of a finite set of points in the plane, S′ P (n) is defined as the largest number of similar copies of P among sets of n points in the plane without 3 points on a line. A general construction, based on iterated Minkovski sums, is used to obtain new lower bounds for S′ P (n) when P is an arbitrary pattern. Improved bounds are obtained when P is a triangle or a re...

Journal: :bulletin of the iranian mathematical society 0
t. amouzegar‎ department of‎ ‎mathematics, quchan university of advanced technology, quchan‎, ‎iran.

let $r$ be a right artinian ring or a perfect commutative‎‎ring‎. ‎let $m$ be a noncosingular self-generator $sum$-lifting‎‎module‎. ‎then $m$ has a direct decomposition $m=oplus_{iin i} m_i$‎,‎where each $m_i$ is noetherian quasi-projective and each‎‎endomorphism ring $end(m_i)$ is local‎.

Journal: :Electronic Notes in Discrete Mathematics 2017
Mirka Miller Joseph F. Ryan Zdenek Ryjácek

A sum graph G is a graph with a mapping of the vertex set of G onto a set of positive integers S in such a way that two vertices of G are adjacent if and only if the sum of their labels is an element of S. In an exclusive sum graph the integers of S that are the sum of two other integers of S form a set of integers that label a collection of isolated vertices associated with the graph G. A grap...

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...

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

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