نتایج جستجو برای: self complementary
تعداد نتایج: 622693 فیلتر نتایج به سال:
In this paper we enumerate the centrally symmetric lozenge tilings of a hexagon with shamrock removed from its center. Our proof is based on variant Kuo’s graphical condensation method in which only three four involved vertices are same face. As special case, obtain new enumeration self-complementary plane partitions.
abstract this study aimed at investigating the possible relationship between self-assessment in writing and self-regulation of iranian efl learners. the main purpose of the study was not only to report and inform about this relationship, but also to investigate and find practical outcomes of the incorporation of self-assessment in writing, such as improving writing skill. the research was carr...
In this paper we present two new classes of binary quantum codes with minimum distance of at least three, by self-complementary self-dual orientable embeddings of “voltage graphs” and “Paley graphs in the Galois field GF (p)”, where p ∈ P and r ∈ Z. The parameters of two new classes of quantum codes are [[(2k + 2)(8k + 7), 2(8k +7k), dmin]] and [[(2k+2)(8k +9), 2(8k +9k +1), dmin]] respectively...
orientation of public and physicians to the complementary and alternative medicine (cam) is one of the most prominent symbols of structural changes in the health service system. the aim of his study was a determination of knowledge, attitude, and practice of general practitioners in complementary and alternative medicine. this cross- sectional study was conducted in qazvin, iran in 2013. a self...
The main topic of the paper is the question of the existence of self-complementary Cayley graphs Cay(G; S) with the property S 6 = G # n S for all 2 Aut(G). We answer this question in the positive by constructing an innnite family of self-complementary circulants with this property. Moreover, we obtain a complete classiication of primes p for which there exist self-complementary circulants of o...
It is provet d that, given any positive integer k, there exists a self-complementary graph with more than 4 .2 4 k vertices which contains no complete subgraph with k+1 vertices . An application of this result to coding theory is mentioned . A graph will be called s-good if it contains neither a complete subgraph with more than s vertices nor an independent set of more than s vertices . A speci...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید