نتایج جستجو برای: bandwidth of a graph
تعداد نتایج: 23286328 فیلتر نتایج به سال:
abstract this quasi-experimental study was aimed at examining the impact of storyline complexity on the grammatical accuracy and complexity of advanced and intermediate efl learners. a total of 65 advanced and intermediate efl learners were selected from iran language institute (ili). an intact group including 35 intermediate participants and another intact group with 30 advanced participants ...
We present a branching scheme for some Vertex Coloring Problems based on a new graph operator called extension. The extension operator is used to generalize the branching scheme proposed by Zykov for the basic problem to a broad class of coloring problems, such as the graph multicoloring, where each vertex requires a multiplicity of colors, the graph bandwidth coloring, where the colors assigne...
فرض کنیمrحلقه ای جابجایی باشد. گراف ایدآل های پوچ کننده ی یکدیگر برای حلق? rرا با نماد(ag(rنمایش داده و بصورت گرافی با مجموعه رئوس*(a(r تعریف میکنیم.دو رأس متمایز در این گراف مجاورند اگر و تنها اگر حاصلضربشان برابر با صفر باشد.بهبودی و راکعی در [ m.behboodi and z.rakeei, the annihilating-ideal graph of commutative ringii, j. algebra apple. 10(4]در مورد گراف ایدآل های پوچ کنند? یکدیگر حدس زدند د...
The edge-bandwidth of a graph G is the bandwidth of the line graph of G. We show asymptotically tight bounds on the edge-bandwidth of two dimensional grids and tori, the product of two cliques and the n-dimensional hypercube.
McDiarmid, C. and Z. Miller, Lattice bandwidth of random graphs, Discrete Applied Mathematics 30 (1991) 221-227. The bandwidth of a random graph has been well studied. A natural generalization of bandwidth involves replacing the path as host graph by a multi-dimensional lattice. In this paper we investigate the corresponding behavior for random graphs.
“any science seeks generalities; the aim is to transcend knowledge of particular cases by discovering general regularities or laws” (chesterman, 2001, p. 1). these were the words of chesterman whose paper has served as a typical example of numerous papers carried out on ‘translation universals’ since the mid-nineties. blum-kulka (1986) is among translation studies scholars who proposed ‘explici...
a professional is someone whose work involves performing a certain function with some degree of expertise. but a narrower definition limits the term to apply to people such as teachers and doctors, whose expertise involves not only skill and knowledge but also the exercise of highly sophisticated judgment, and whose accreditation necessitates extensive study, often university-based as well as p...
learning english is very popular all over the world nowadays and it is considered a high prestigious language among citizens of different societies. one of the most important materials for learning a new language are textbooks. the debate that whether learning a new language is natural and neutral or ideological and influential on people’s worldviews, has always been of great importance.
The bandwidth is an important invariant in graph theory. However, the problem to determine the bandwidth of a general graph is NP-complete. To get sharp bounds, we propose to pay attention to various duality properties or minimax relations related to the bandwidth problem. This paper presents a summary in this point of view.
abstract: in the paper of black and scholes (1973) a closed form solution for the price of a european option is derived . as extension to the black and scholes model with constant volatility, option pricing model with time varying volatility have been suggested within the frame work of generalized autoregressive conditional heteroskedasticity (garch) . these processes can explain a number of em...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید