Abstract We show that the necessary conditions for decomposition of complete graph odd order into cycles a fixed even length and minus 1‐factor are also sufficient. © 2002 John Wiley & Sons, Inc. J Combin Designs 10: 27–78,

A questionnaire is a sequence of multiple choice questions aiming to collect data on population. We define an abstract as ordered pair $(N,{\cal M})$, where $N$ positive integer and ${\cal M}=(m_0,m_1,\ldots,m_{N-1})$ $N$-tuple integers, with $m_i$, for $i \in \{0, 1, \ldots, N-1 \}$, the number possible answers question $i$. An may be endowed skip-list (which tells us which skip based earlier questions) flag-set sequences are special interest). FS-decision tree decision that also...

ABSTRACT The directed Oberwolfach problem asks whether the complete symmetric digraph , assuming admits a decomposition into spanning subdigraphs, each disjoint union of cycles lengths . We hereby describe method for constructing solution to given some if certain conditions on are satisfied. This approach enables us extend as well where denotes copies 2, provided is sufficiently large. In particular, our recursive construction allows effectively address two‐table problem. show that has all...

A modified theory of planned behaviour (acronym CASCADA) proposes that Conscious knowledge precedes a change in Attitude, which turn positive deviations from negative Subjective norms, intention to Change, perception Agency change, Discussion possible action, and Action itself. We used this as results chain investigate gender-specific dynamics chemical-free dengue prevention. Secondary analysis the Mexican arm cluster randomised controlled trial household survey data on intermediate outcomes...

In this paper we study various fundamental connectivity properties of hypergraphs from a graph-theoretic perspective, with the emphasis on cut edges, vertices, and blocks. We prove number new results involving these concepts. particular, describe exact relationship between block decomposition hypergraph its incidence graph.

Background: Anemia is one of the major problems among adolescents in India. As daily and once weekly supplementation iron folic acid show same effects terms growth rate, it has been decided that supply an effective method to tackle anaemia. The adherence these tablets important factor monitor programme. Methods: A cross sectional study was conducted school students 6-10th classes Thrissur corporation area for a period 6 months regarding tablets. Sample size calculated based on pilot cluster...

Fuzzy cognitive mapping (FCM) is a practical tool in participatory research. Its main use clarifying causal understandings from several knowledge sources. It provides shared substrate or language for sharing views of causality. This makes it easier different interest groups to agree what do next. Each map collection relationships with three elements: factors (cause and outcome), arrows linking factors, weights indicating the perceived influence each cause on its outcome. Stakeholder maps are...

Background: Substance abuse in various forms has been a social problem for many centuries. Kerala shows high prevalence alcoholism and is ranked top India. This study aimed at finding the determinants of substance among youth central part South India.Methods: A community based was done with 402 college student participants using self- administered pretested semi structured questionnaire. Data entered into microsoft excel analysed Epiinfo3.5.3.Results: Out students, 31.8% used or abused any...

We generalize the notion of an Euler tour in a graph following way. An family hypergraph is closed walks that jointly traverse each edge exactly once. tourthus corresponds to with single component. provide necessary and sufficient conditions for existence arbitrary hypergraph, particular, we show every 3-uniform without cut edges admits family. Finally, problem polynomial on class all hypergraphs.This work complements existing results rank-1 universal cycles 1-overlap triple systems, as well...

Using the technique of amalgamation-detachment, we show that complete equipartite multigraph $\lambda K_{n\times m}$ can be decomposed into cycles lengths $c_1m,\dots,c_km$ (plus a 1-factor if degree is odd) whenever there exists decomposition m K_n$ $c_1, \dots,c_k$ odd). In addition, give sufficient conditions for existence some other, related cycle decompositions m}$.

An Euler tour of a hypergraph (also called rank-2 universal cycle or 1-overlap in the context designs) is closed walk that traverses every edge exactly once. In this paper, using graph-theoretic approach, we prove triple system with at least two triples eulerian, is, it admits an tour. Horan and Hurlbert have previously shown for admissible order >3, there exists Steiner tour, while Dewar Stevens proved cyclic >3 twofold

We examine the necessary and sufficient conditions for a complete symmetric digraph $K_n^\ast$ to admit resolvable decomposition into directed cycles of length $m$. give solution even $m$, partial odd

Abstract We determine the necessary and sufficient conditions for existence of a decomposition complete graph even order with 1‐factor added into cycles equal length. © 2003 Wiley Periodicals, Inc. J Combin Designs 11: 170–207, 2003; Published online in InterScience ( www.interscience.wiley.com ). DOI 10.1002/jcd.10019

We show that the complete symmetric digraph $K_{2m}^\ast$ admits a resolvable decomposition into directed cycles of length $m$ for all odd $m$, $5 \le m 49$. Consequently, $K_{n}^\ast$ $n \equiv 0 \pmod{2m}$ and

We prove that $K_n+I$, the complete graph of an even order with a $1$-factor duplicated, admits decomposition into $2$-factors, each disjoint union cycles length $m \geq 5$ if and only \mid n$, except possibly when $m$ is odd $n=4m$. In addition, we show $K_n+I$ lengths $m_1, \ldots, m_t$, whenever m_t$ are all even.