نتایج جستجو برای: subdivision of a graph
تعداد نتایج: 23284708 فیلتر نتایج به سال:
burnout is a response to the chronic work stress which is prevalent mostly among the people who do people job, like teaching. the purpose of this study was to develop a valid and reliable instrument that can measure burnout in foreign language teachers. although some widely used instruments were developed before which measured burnout in teachers, a specific instrument which include specific sy...
In this paper we provide concrete combinatorial formal deformation algorithms, namely sequences of elementary collapses and expansions, which relate various previously extensively studied families of combinatorially defined polyhedral complexes. To start with, we give a sequence of elementary collapses leading from the barycentric subdivision of the neighborhood complex to the Lovász complex of...
bandwidth labelling is a well known research area in graph theory. we provide a new proof that the bandwidth of mobius ladder is 4, if it is not a $k_{4}$, and investigate the bandwidth of a wider class of mobius graphs of even strips.
this thesis is a study on insurance fraud in iran automobile insurance industry and explores the usage of expert linkage between un-supervised clustering and analytical hierarchy process(ahp), and renders the findings from applying these algorithms for automobile insurance claim fraud detection. the expert linkage determination objective function plan provides us with a way to determine whi...
chapters 1 and 2 establish the basic theory of amenability of topological groups and amenability of banach algebras. also we prove that. if g is a topological group, then r (wluc (g)) (resp. r (luc (g))) if and only if there exists a mean m on wluc (g) (resp. luc (g)) such that for every wluc (g) (resp. every luc (g)) and every element d of a dense subset d od g, m (r)m (f) holds. chapter 3 inv...
In this paper we provide concrete combinatorial formal deformation algorithms, namely sequences of elementary collapses and expansions, which relate various previously extensively studied families of combinatorially defined polyhedral complexes. To start with, we give a sequence of elementary collapses leading from the barycentric subdivision of the neighborhood complex to the Lovász complex of...
chapter one is devoted to a moderate discussion on preliminaries, according to our requirements. chapter two which is based on our work in (24) is devoted introducting weighted semigroups (s, w), and studying some famous function spaces on them, especially the relations between go (s, w) and other function speces are invesigated. in fact this chapter is a complement to (32). one of the main fea...
A cubic graph H is called a Kotzig graph if H has a circuit double cover consisting of three Hamilton circuits. It was first proved by Goddyn that if a cubic graph G contains a spanning subgraph H which is a subdivision of a Kotzig graph then G has a circuit double cover. A spanning subgraph H of a cubic graph G is called a Kotzig frame if the contracted graph G/H is even and every non-circuit ...
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...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید