نتایج جستجو برای: triangular and circular graph products

تعداد نتایج: 16894565  

Journal: :Learning & behavior 2009
Murray R Horne John M Pearce

In the blocking phase of three experiments, rats had to find a submerged platform beneath a spherical landmark in one corner of a triangular pool. Prior to this treatment, they were required to find the platform relative to either a sphere above it (blocking groups) or a rod attached to it (control groups). The position of the platform changed from trial to trial for the initial training. The s...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه شهرکرد - دانشکده ادبیات و زبانهای خارجی 1392

the application of a comprehensive model of communicative language ability (cla) to language teaching and testing has always been an imperative in l2 education since hymess proposal of communicative competence in the 1970s. recent l2 research has clearly underscored the importance of sufficient pragmatics representation as an essential component of cla in pedagogical and testing practices in l2...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه یزد 1388

this study considers the level of increase in customer satisfaction by supplying the variant customer requirements with respect to organizational restrictions. in this regard, anp, qfd and bgp techniques are used in a fuzzy set and a model is proposed in order to help the organization optimize the multi-objective decision-making process. the prioritization of technical attributes is the result ...

Journal: :Eur. J. Comb. 2012
Xinmin Hou Hong-Jian Lai Mingquan Zhan Taoye Zhang Ju Zhou

A graph G is k-triangular if each edge of G is in at least k triangles. It is conjectured that every 4-edge-connected 1-triangular graph admits a nowhere-zero Z3-flow. However, it has been proved that not all such graphs are Z3-connected. In this paper, we show that every 4-edge-connected 2-triangular graph is Z3-connected. The result is best possible. This result provides evidence to support t...

1999
Guillermo Durán Chih Lin

The intersection graph of a family of arcs on a circle is called a circular-arc graph. This class of graphs admits some interesting subclasses: proper circular-arc graphs, unit circular-arc graphs, Helly circular-arc graphs and clique-Helly circular-arc graphs. In this paper, all possible intersections of these subclasses are studied. There are thirteen regions. Twelve of these are nonempty, an...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه سمنان - دانشکده مدیریت و اقتصاد 1392

these days, all department stores make an effort to provide their clients with valuable products in order to project the best image for them. as a result, clients’ comprehension risk will decrease and they will be more willing to repurchase. having a good image is really important for the department stores because it makes an impression on clients’ comprehension of both quality and risk. consid...

Journal: :Taiwanese Journal of Mathematics 2000

Journal: :Linear Algebra and its Applications 1999

Journal: :Discrete Mathematics 2006
Flavia Bonomo

A clique in a graph is a complete subgraph maximal under inclusion. The clique graph of a graph is the intersection graph of its cliques. A graph is self-clique when it is isomorphic to its clique graph. A circular-arc graph is the intersection graph of a family of arcs of a circle. A Helly circular-arc graph is a circular-arc graph admitting a model whose arcs satisfy the Helly property. In th...

Journal: :European Journal of Combinatorics 2009

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید