data on body weight and body measurements (body length, height at withers, chest girth and paunch girth) of adult kilakarsal sheep have been collected from 124 adult animals managed at the farmers filed in tirunelveli districts of tami nadu, india to estimate the body weight from body measurements. the data were subjected to standard statistical analysis using spss software and linear regressio...

Data on body weight and body measurements (body length, height at withers, chest girth and paunch girth) of adult Kilakarsal sheep have been collected from 124 adult animals managed at the farmers filed in Tirunelveli districts of Tami Nadu, India to estimate the body weight from body measurements. The data were subjected to standard statistical analysis using SPSS software and linear regressio...

DISCLAIMER: Everything that follows is of a preliminary nature. We give a new invariant for finitely generated groups, called the girth. Several results which indicate that the girth of a group might possibly be a quasi-isometry invariant are proved. We also compute the girth in several instances and speculate on the relation of girth to the growth of groups.

a set $wsubseteq v(g)$ is called a resolving set for $g$, if for each two distinct vertices $u,vin v(g)$ there exists $win w$ such that $d(u,w)neq d(v,w)$, where $d(x,y)$ is the distance between the vertices $x$ and $y$. the minimum cardinality of a resolving set for $g$ is called the metric dimension of $g$, and denoted by $dim(g)$. in this paper, it is proved that in a connected graph $...

For an arbitrary (3,L) QC-LDPC code with a girth of twelve, a tight lower bound of the consecutive lengths is proposed. For an arbitrary length above the bound the resultant code necessarily has a girth of twelve, and for the length meeting the bound, the corresponding code inevitably has a girth smaller than twelve. The conclusion can play an important role in the proofs of the existence of la...

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