نتایج جستجو برای: order difference interval graph

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

Journal: :transactions on combinatorics 2012
p. balakrishnan r. kala

‎in this paper we introduce the concept of order difference interval graph $gamma_{odi}(g)$ of a group $g$‎. ‎it is a graph $gamma_{odi}(g)$ with $v(gamma_{odi}(g)) = g$ and two vertices $a$ and $b$ are adjacent in $gamma_{odi}(g)$ if and only if $o(b)-o(a) in [o(a)‎, ‎o(b)]$‎. ‎without loss of generality‎, ‎we assume that $o(a) leq o(b)$‎. ‎in this paper we obtain several properties of $gamma_...

پایان نامه :0 1374

the rationale behind the present study is that particular learning strategies produce more effective results when applied together. the present study tried to investigate the efficiency of the semantic-context strategy alone with a technique called, keyword method. to clarify the point, the current study seeked to find answer to the following question: are the keyword and semantic-context metho...

پایان نامه :دانشگاه آزاد اسلامی - دانشگاه آزاد اسلامی واحد تهران مرکزی - دانشکده زبانهای خارجی 1390

writing as a productive skill requires practice in the basic sub-skills of vocabulary and grammar. in fact, grammar has been viewed as the core of programs in writing classes to help the students put the elements of sentence together and combine sentences of specific lengths to come up with an error-free work of art. conceptualizing l2 writing in this way introduces writing as a product and enc...

Journal: :Communications, Faculty Of Science, University of Ankara Series A1Mathematics and Statistics 2009

Journal: :Annals of Combinatorics 2012

Journal: :algebraic structures and their applications 0
hamid reza dorbidi university of jiroft

the order graph of a group $g$, denoted by $gamma^*(g)$, is a graph whose vertices are subgroups of $g$ and two distinct vertices $h$ and $k$ are adjacent if and only if $|h|big{|}|k|$ or $|k|big{|}|h|$. in this paper, we study the connectivity and diameter of this  graph. also we give a relation between the order graph and prime  graph of a group.

Journal: :Journal of Combinatorial Theory 1969

Journal: :Discrete Applied Mathematics 2015

2009
Suh-Ryung KIM Jung Yeun LEE Boram PARK Won Jin PARK Yoshio SANO

The competition graph of a doubly partial order is known to be an interval graph. The competition-common enemy graph of a doubly partial order is also known to be an interval graph unless it contains a cycle of length 4 as an induced subgraph. In this paper, we show that the niche graph of a doubly partial order is not necessarily an interval graph. In fact, we prove that, for each n ≥ 4, there...

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

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