نتایج جستجو برای: odd

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

Journal: :Eur. J. Comb. 2014
Marien Abreu Domenico Labbate Romeo Rizzi John Sheehan

A snark is a cubic cyclically 4–edge connected graph with edge chromatic number four and girth at least five. We say that a graph G is odd 2–factored if for each 2–factor F of G each cycle of F is odd. In this paper, we present a method for constructing odd 2–factored snarks. In particular, we construct two new odd 2–factored snarks that disprove a conjecture by some of the authors. Moreover, w...

Journal: :bulletin of the iranian mathematical society 0
b. yao college of mathematics and statistics‎, ‎northwest‎ ‎normal university‎, ‎lanzhou‎, ‎730070‎, ‎china. x. liu school of mathematics and statistics‎, ‎beijing institute of techology‎, ‎beijing 100081‎, ‎china. m. yao department of information process and control engineering‎, ‎lanzhou petrochemical college of vocational technology‎, ‎lanzhou‎, ‎730060‎, ‎china.

there are many long-standing conjectures related with some labellings of trees. it is important to connect labellings that are related with conjectures. we find some connections between known labellings of simple graphs.

Journal: :journal of family and reproductive health 0
mukesh mishra department of social science, nims college, lalitpur, nepal

objective: regardless of three decades of implementation of family planning program in nepal, need of family planning services is largely unmet. systematic studies, evaluating the impact of family program on several ethnic groups of nepal has not been carried out in large scale. this study sheds light on the investigation of, whether the use of contraceptives varies among different ethnic group...

Journal: :Algorithmica 2021

We study the complexity of problems finding, given a graph G, largest induced subgraph G with all degrees odd (called an subgraph), and smallest number subgraphs that partition V(G). call these parameters $$\mathsf{mos}(G)$$ $$\chi _{\mathsf{odd}}(G)$$ , respectively. prove deciding whether _{\mathsf{odd}}(G) \le q$$ is polynomial-time solvable if $$q 2$$ NP-complete otherwise. provide algorith...

Journal: :Psychological medicine 2010
M Aebi U C Müller P Asherson T Banaschewski J Buitelaar R Ebstein J Eisenberg M Gill I Manor A Miranda R D Oades H Roeyers A Rothenberger J Sergeant E Sonuga-Barke M Thompson E Taylor S V Faraone H-C Steinhausen

BACKGROUND Oppositional defiant disorder (ODD) is frequently co-occurring with attention deficit hyperactivity disorder (ADHD) in children and adolescents. Because ODD is a precursor of later conduct disorder (CD) and affective disorders, early diagnostic identification is warranted. Furthermore, the predictability of three recently confirmed ODD dimensions (ODD-irritable, ODD-headstrong and OD...

Journal: :Applied optics 1993
C Ai J C Wyant

We describe a modified three-flat method. In a Cartesian coordinate system, a flat can be expressed as the sum of even-odd, odd-even, even-even, and odd-odd functions. The even-odd and the odd-even functions of each flat are obtained first, and then the even-even function is calculated. All three functions are exact. The odd-odd function is difficult to obtain. In theory, this function can be s...

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

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