This study aimed to examine the notable distinctions in anthropometric measurements, cardio-respiratory indicators, and body composition parameters among secretarial staff at Prince Abubakar Audu University Anyigba. The researchers employed a complete enumeration procedure select from university's seven faculties. variables considered included girth measurements such as thigh, mid-thigh, hip, w...

Graph G is the square of graph H if two vertices x, y have an edge in G if and only if x, y are of distance at most two in H . Given H it is easy to compute its square H, however Motwani and Sudan proved that it is NP-complete to determine if a given graph G is the square of some graph H (of girth 3). In this paper we consider the characterization and recognition problems of graphs that are squ...

My research revolves around structural and extremal aspects of Graph Theory, particularly problems involving girth and distance, trees, cycles in graphs, and some variations of Ramsey theory. I have also done some work in generalized graph colorings and graph labellings. My other interests include graph decomposi-tions and packings, perfect graphs, matching theory, hypergraphs and coding theory...

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

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

Girth pairs were introduced by Harary and Kovács [Regular graphs with given girth pair, J. Graph Theory 7 (1983) 209–218]. The odd girth (even girth) of a graph is the length of a shortest odd (even) cycle. Let g denote the smaller of the odd and even girths, and let h denote the larger. Then (g, h) is called the girth pair of the graph. In this paper we prove that a graph with girth pair (g, h...

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

The STAM protein plays an important role in the cytokine-related JAK/STAT pathway. We selected the STAM2 gene as a candidate gene that could be linked to growth performance in analysis of a Chinese cattle breed (Wuchuan Black cattle). We examined genetic variants in the promoter region of the STAM2 gene and their associations with eight growth traits in 159 individuals. Seven SNPs, which includ...