A method to construct girth-12 (3,L) quasi-cyclic lowdensity parity-check (QC-LDPC) codes with all lengths larger than a certain given number is proposed, via a given girth-12 code subjected to some constraints. The lengths of these codes can be arbitrary integers of the form LP, provided that P is larger than a tight lower bound determined by the maximal element within the exponent matrix of t...

It is well known that 3–regular graphs with arbitrarily large girth exist. Three constructions are given that use the former to produce non-Hamiltonian 3–regular graphs without reducing the girth, thereby proving that such graphs with arbitrarily large girth also exist. The resulting graphs can be 1–, 2– or 3–edge-connected depending on the construction chosen. From the constructions arise (nai...

An evaluation of reproductive performance, behavior, immunity and ergonomics was conducted for two common sow housing systems: the girth tether and crate. Littermate Yorkshire × Landrace gilts were randomly assigned to either the crate or girth tether system and they remained in that treatment for two consecutive pregnancies and lactations. A total of 171 matings resulted in 141 litters (82.4% ...

INTRODUCTION Current girth augmentation techniques rely either on liposuction/injection or on the use of dermal fat grafts. These procedures have serious disadvantages, including regression in gained size, deformities, irregular contour, and asymmetry. Ideally, the augmentation technique should ensure durability and symmetry. This case report describes the first application of a flap (superfici...

We describe two computational methods for the construction of cubic graphs with given girth. These were used to produce two independent proofs that the (3, 9)-cages, defined as the smallest cubic graphs of girth 9, have 58 vertices. There are exactly 18 such graphs. We also show that cubic graphs of girth 11 must have at least 106 vertices and cubic graphs of girth 13 must have at least 196 ver...

We describe two new algorithms for the generation of all non-isomorphic cubic graphs with girth at least k ≥ 5 which are very efficient for 5 ≤ k ≤ 7 and show how these algorithms can be efficiently restricted to generate snarks with girth at least k. Our implementation of these algorithms is more than 30, respectively 40 times faster than the previously fastest generator for cubic graphs with ...

AIM The aim was to study the polymorphism of exon 2 and exon 3 of growth hormone (GH) gene, to test the polymorphic variants for Hardy-Weinberg equilibrium and to investigate association of these polymorphisms with chest girth and paunch girth in Sirohi and Barbari breeds of goat. MATERIALS AND METHODS A total of 80 kids involving forty each of Sirohi and Barbari breeds of goat were included ...

The aim of this study is to estimate body weight from withers height, body length, and chest girth measurements by using Regression Tree (RT) Method. For this purpose, data were collected from 239 male sheep at yearling age (11-13 months) of five indigenous sheep breeds (Mengali (48), Balochi (48), Harnai (48), Beverigh (47) and Rakhshani (48)) reared in Balochistan, Pakistan. Bivariate relatio...

W. He et al. showed that a planar graph of girth 11 can be decomposed into a forest and a matching. D. Kleitman et al. proved the same statement for planar graphs of girth 10. We further improve the bound on girth to 9. c © 2007 Elsevier Ltd. All rights reserved.