نتایج جستجو برای: diameter of capitul
تعداد نتایج: 21166970 فیلتر نتایج به سال:
like any other learning activity, translation is a problem solving activity which involves executing parallel cognitive processes. the ability to think about these higher processes, plan, organize, monitor and evaluate the most influential executive cognitive processes is what flavell (1975) called “metacognition” which encompasses raising awareness of mental processes as well as using effectiv...
we show that when both sources ( lepton flavor violation sources and cp-violating phases) are present, the electric dipole moment of the electron, $d_e$, receives a contribution from the phase of the trilinear $a$-term of staus, $phi_{a_ au}$. for $phi_{a_ au}=pi/2$, the value of $d_e$, depending on the ratios of the lfv mass elements, can range between zero and three orders of magnitude a...
the history of plant’s used for mankind is as old as the start of humankind. initially, people used plants for their nutritional proposes but after the discovery of medicinal properties, this natural ?ora became a useful source of disease cure and health improvement across various human communities. berberis vulgaris is one of the medicinal plants used in iranian traditional medicine. berberis ...
Given a configuration of indistinguishable pebbles on the vertices of a connected graph G on n vertices, a pebbling move is defined as the removal of two pebbles from some vertex, and the placement of one pebble on an adjacent vertex. The m-pebbling number of a graph G, πm(G), is the smallest integer k such that for each vertex v and each configuration of k pebbles on G there is a sequence of p...
A graph that contains a spanning tree of diameter at most t clearly admits a tree t-spanner, since a tree t-spanner of a graph G is a sub tree of G such that the distance between pairs of vertices in the tree is at most t times their distance in G. In this paper, graphs that admit a tree t-spanner of diameter at most t + 1 are studied. For t equal to 1 or 2 the problem has been solved. For t = ...
We prove that for every connected 4-colourable graph G of order n and minimum degree δ ≥ 1, diam(G) ≤ 5n 2δ − 1. This is a first step toward proving a conjecture of Erdős, Pach, Pollack and Tuza [4] from 1989.
Extending some recent theorems of Klee and Larman, we prove rather sharp results about the diameter of a random graph. Among others we show that if d = d(n) > 3 and m = m(n) satisfy (log n)/d 3 log log n -> oo, 2rf_Imd'/'nd+x log n -» oo and dd~2md~l/nd — log n -» -oo then almost every graph with n labelled vertices and m edges has diameter d. About twenty years ago Erdös [7], [8] used random g...
Diameter of the 2 k-node Knn odel graph is d(k + 2)=2e:
the major purpose of this study was to develop the translation teacher competency test (ttct) and examine its construct and predictive validity. the present study was conducted in two phases: a qualitative phase as well as a quantitative phase. in the first phase of the study, the author attempted to find out the major areas of competency required for an academic translation teacher. the second...
the purpose of this two-phase, sequential mixed methods study was to find out whether there were any decencies between male and female ma students’ theses regarding the common features of academic writing such as syntactic complexity, means of integrating cited information, and organizing arguments. i chose 10 male written theses and 15 female written theses in tefl and linguistics. in the firs...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید