نتایج جستجو برای: equitable relatedness fulfillment

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

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: :Occupational Health Nursing 1980

2015
S K Vaidya N J Kothari

A subset D of ( ) V G is called an equitable dominating set if for every ( ) v V G D   there exists a vertex u D  such that ( ) uv E G  and | ( ) ( ) | 1 deg u deg v   . A subset D of ( ) V G is called an equitable independent set if for any , u D v   ( ) e N u for all { } v D u   . The concept of equi independent equitable domination is a combination of these two important concepts. ...

2014
LIANCUI ZUO FANGLAN WU SHAOQIANG ZHANG

By the sorting method of vertices, the equitable chromatic number and the equitable chromatic threshold of the Cartesian products of wheels with bipartite graphs are obtained. Key–Words: Cartesian product, Equitable coloring, Equitable chromatic number, Equitable chromatic threshold

Journal: :Nature 1976

Journal: :Electronic Notes in Discrete Mathematics 2015
Irina Shirgazina

The paper is devoted to the combinatorial problem concerning equitable colorings of non-uniform simple hypergraphs. Let H = (V,E) be a hypergraph, a coloring with r colors of its vertex set V is called equitable if it is proper (i.e. none of the edges is monochromatic) and the cardinalities of the color classes differ by at most one. We show that if H is a simple hypergraph with minimum edge-ca...

2012
MA Gang

A proper total-coloring of graph G is said to be equitable if the number of elements (vertices and edges) in any two color classes differ by at most one, which the required minimum number of colors is called the equitable total chromatic number. In this paper, we prove some theorems on equitable total coloring and derive the equitable total chromatic numbers of Pm ∨ Sn, Pm ∨ Fn and Pm ∨Wn. Keyw...

Journal: :پژوهش های کاربردی روانشناختی 0

self-determination theory (sdt) states that satisfaction of basic psychological needs, including the need for autonomy, competence and relatedness will lead to intrinsic motivation. this study examines the relationship between basic psychological needs and intrinsic motivation of iranian female students in mathematics. for this purpose, 382 students of five school responded to the scale of intr...

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

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