نتایج جستجو برای: types of graphs
تعداد نتایج: 21183499 فیلتر نتایج به سال:
abstract while task-based instruction is considered as the most effective way to learn a language in the related literature, it is oversimplified on various grounds. different variables may affect how students are engaged with not only the language but also with the task itself. the present study was conducted to investigate language and task related engagement on the basis of the task typolog...
در این پایان نامه دو مقاله زیر بررسی شده اند، که اولی در مورد رنگ آمیزی موقعیت یاب و عدد رنگی موقعیت یاب گراف ها است و دیگری همه ی درخت های با عدد رنگی موقعیت یابی 3 را مشخص می کند. همچنین در این پایان نامه عدد رنگی موقعیت یاب گراف های مسیر، دور، کامل، دوبخشی، ستاره ها، درخت های دو ستاره و کاترپیلارها را مشخص می کند.
abstract birbery and corruption and other criminal and as such is one of social phenomena , and i can firmly say that society is protected and safe from harm , this is criminal . eache community is familiar with these crimes and the crime associated ( direct or indirect ) with the political economic , social , and cultural beliefs and religious issues , especially with the community . admitted...
a large number of single research studies on the effects of strategy-based instruction (sbi) in teaching english as a foreign or second language has been conducted so far. however, the lack of a comprehensive meta-analysis targeting the effectiveness of english language sbi is observed. moreover, the findings of experimental studies regarding the context of the english language, proficiency lev...
solvable graphs (also known as reachable graphs) are types of graphs that any arrangement of a specified number of agents located on the graph’s vertices can be reached from any initial arrangement through agents’ moves along the graph’s edges, while avoiding deadlocks (interceptions). in this paper, the properties of solvable graphs are investigated, and a new concept in multi agent moti...
in this paper we introduce mixed unitary cayley graph $m_{n}$ $(n>1)$ and compute its eigenvalues. we also compute the energy of $m_{n}$ for some $n$.
the purpose of this study was to investigate how english language teachers in mashhad who teach students in the pre-university cycle perceived the impact of the efltee on their teaching. the target population was nearly all pre-university english language teachers in seven districts of mashhad in the scholastic year 2008/2009. a survey questionnaire which consisted of (36) likert type items, wa...
power transformers are important equipments in power systems. thus there is a large number of researches devoted of power transformers. however, there is still a demand for future investigations, especially in the field of diagnosis of transformer failures. in order to fulfill the demand, the first part reports a study case in which four main types of failures on the active part are investigate...
In this paper, we characterize the shellable complete $t$-partite graphs. We also show for these types of graphs the concepts vertex decomposable, shellable and sequentially Cohen-Macaulay are equivalent. Furthermore, we give a combinatorial condition for the Cohen-Macaulay complete $t$-partite graphs.
In this paper we obtain an upper bound and also a lower bound for maximum edges of strongly 2 multiplicative graphs of order n. Also we prove that triangular ladder the graph obtained by duplication of an arbitrary edge by a new vertex in path and the graphobtained by duplicating all vertices by new edges in a path and some other graphs are strongly 2 multiplicative
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید