نتایج جستجو برای: bejan number
تعداد نتایج: 1168369 فیلتر نتایج به سال:
a set $s$ of vertices in a graph $g$ is a dominating set if every vertex of $v-s$ is adjacent to some vertex in $s$. the domination number $gamma(g)$ is the minimum cardinality of a dominating set in $g$. the annihilation number $a(g)$ is the largest integer $k$ such that the sum of the first $k$ terms of the non-decreasing degree sequence of $g$ is at most the number of edges in $g$. in this p...
the present study is an experimental case study which investigates the impacts, if any, of skopos on syntactic features of the target text. two test groups each consisting of 10 ma students translated a set of sentences selected from advertising texts in the operative and informative mode. the resulting target texts were then statistically analyzed in terms of the number of words, phrases, si...
rested on sociocultural theory (sct), this study attempted to examine the effect of written corrective feedback (wcf) followed by producing written languaging on developing writing accuracy over new tasks. to this aim, two intact iranian efl classes at the low-intermediate level were randomly assigned to two experimental groups: direct (n = 25) and indirect (n = 25). both groups wrote on a numb...
a subset $s$ of vertices in a graph $g$ is called a geodetic set if every vertex not in $s$ lies on a shortest path between two vertices from $s$. a subset $d$ of vertices in $g$ is called dominating set if every vertex not in $d$ has at least one neighbor in $d$. a geodetic dominating set $s$ is both a geodetic and a dominating set. the geodetic (domination, geodetic domination) number...
let $p$ be a prime number and $n$ be a positive integer. the graph $g_p(n)$ is a graph with vertex set $[n]={1,2,ldots ,n}$, in which there is an arc from $u$ to $v$ if and only if $uneq v$ and $pnmid u+v$. in this paper it is shown that $g_p(n)$ is a perfect graph. in addition, an explicit formula for the chromatic number of such graph is given.
jahanshahloo has suggested a method for the solving linear programming problems with zero-one variables. in this paper we formulate fully fuzzy linear programming problems with zero-one variables and a method for solving these problems is presented using the ranking function and also the branch and bound method along with an example is presented.
abstract this research has been carried out with the purpose of investigating the conditions and related elements of the employment of the educational sciences graduates of hamedan province universities in 1382-1387 academic years. it has been a descriptive research of a correlation kind, and the population number has been 1180 grduates of payam- e noor universites in asad – abaad, kaboudaraha...
the present study set out (a) to examine the categories of pedagogical knowledge related to the act of teaching of novice and experienced teachers as gleaned from their verbal report of what they were thinking about while teaching and (b) to compare the categories of pedagogical knowledge of novice and experienced teachers. the aim of comparing these two groups of teachers was to see whether di...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید