On Self-Complementary Cyclic Packing of Forests
نویسندگان
چکیده
منابع مشابه
On Self-Complementary Cyclic Packing of Forests
A graph is self-complementary if it is isomorphic to its complement. In this paper we prove that every forest of order 4p and size less than 3p is a subgraph of a self-complementary graph of order 4p with a cyclic self-complementary permutation. We also discuss some generalization of the main result.
متن کاملan investigation of the impact of self monitoring on langauge teachers motivational practice and its effect on learners motivation
the central purpose of this study was to conduct a case study about the role of self monitoring in teacher’s use of motivational strategies. furthermore it focused on how these strategies affected students’ motivational behavior. although many studies have been done to investigate teachers’ motivational strategies use (cheng & d?rnyei, 2007; d?rnyei & csizer, 1998; green, 2001, guilloteaux & d?...
On almost self-complementary graphs
A graph is called almost self-complementary if it is isomorphic to one of its almost complements Xc − I, where Xc denotes the complement of X and I a perfect matching (1-factor) in Xc. Almost self-complementary circulant graphs were first studied by Dobson and Šajna in 2004. In this paper we investigate some of the properties and constructions of general almost self-complementary graphs. In par...
متن کاملOn separable self-complementary graphs
In this paper, we describe the structure of separable self-complementary graphs. c © 2002 Elsevier Science B.V. All rights reserved.
متن کاملQuasi-Cyclic Complementary Dual Code
LCD codes are linear codes that intersect with their dual trivially. Quasi-cyclic codes that are LCD are characterized and studied by using their concatenated structure. Some asymptotic results are derived. Hermitian LCD codes are introduced to that end and their cyclic subclass is characterized. Constructions of QCCD codes from codes over larger alphabets are given.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2007
ISSN: 1077-8926
DOI: 10.37236/980