Let D be a strongly connected digraph. The strong distance between two vertices u and v in D, denoted by sdD(u; v) is the minimum size of a strongly connected subdigraph of D containing u and v. The strong eccentricity, se(u), of a vertex u of D, is the strong distance between u and a vertex farthest from u. The minimum strong eccentricity among the vertices of D is the strong radius, srad(D), ...

All weakly distance-regular digraphs with girth $2$ and k-k_{1,1}=1 are classified. A Family of Weakly Distance-Regular Digraphs of Girth 2 Kaishun Wang∗ School of Mathematical Sciences Beijing Normal University Beijing 100875, P.R. China Abstract All weakly distance-regular digraphs with girth 2 and k − k1,1 = 1 are classified.All weakly distance-regular digraphs with girth 2 and k − k1,1 = 1 ...

The field experiment was conducted to elicit information on the yield and nutrient uptake of elephant foot yam [Amorphophallus paeoniflorins (Dennest.) Nicolson] under fertigation at orchard, Department Vegetable Crops, TNAU, Coimbatore during year 2012-2013. laid out in randomized block design with three replications. growth attributes viz., plant height, canopy spread, leaf area, pseudo stem ...

A long-term field experiment initiated in the year 2018-19, was selected for conduct of present study order to determine effect different bamboo species on growth attributing characters after 2nd plantation grown Entisol semi-arid climate during 2020-21. The treatment Bambusa tulda recorded highest number culms per clump (59.32), culm density (49413.56 ha-1), new (13.80) and girth (717.27 cm) o...

Hypergraphic matroids were de ned by Lorea as generalizations of graphic matroids. We show that the minimum cut (co-girth) of a multiple of a hypergraphic matroid can be computed in polynomial time. It is well-known that the size of the minimum cut (co-girth) of a graph can be computed in polynomial time. For connected graphs, this is equivalent to computing the co-girth of the circuit matroid....

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...