Patterns of fetal growth predict non-communicable disease risk in adult life, but fetal growth variability appears to have a relatively weak association with maternal nutritional dynamics during pregnancy. This challenges the interpretation of fetal growth variability as 'adaptation'. We hypothesized that associations of maternal size and nutritional status with neonatal size are mediated by th...

Recently, it was proved that if the diameter D of a graph G is small enough in comparison with its girth, then G is maximally connected and that a similar result also holds for digraphs. More precisely, if the diameter D of a digraph G satisfies D 5 21 1, then G has maximum connectivity ( K = 6 ) . and if D 5 21, then it attains maximum edge-connectivity ( A = 6 ) , where I is a parameter which...

Weakly s-arc transitive graphs are introduced and determined. A graph is said to be weakly s-arc transitive if its endomorphism monoid acts transitively on the set of s-arcs. The main results are: (1) A nonbipartite graph is weakly s-arc transitive if and only if it is s-arc transitive. (2) A tree with diameter d is weakly s-arc transitive for all 0 s d. (3) A bipartite graph with girth g = 2s ...

In this paper we study zero-divisor graphs of semirings. We show that all zero-divisor graphs of (possibly noncommutative) semirings are connected and have diameter less than or equal to 3. We characterize all acyclic zero-divisor graphs of semirings and prove that in the case zero-divisor graphs are cyclic, their girths are less than or equal to 4. We also give a description of the zero-diviso...

Let C2k denote the cycle of length 2k and Cg = {C3, C4, . . . , Cg}. The girth of a graph G containing a cycle is the length of a shortest cycle in G, so a graph has girth at least g + 1 if it is Cg-free. The distance between vertices u and v in a graph G, denoted dG(u, v) is the minimum length of a uv-path in G. Then dG(·, ·) is a metric on V (G). The diameter of a connected graph G is max{dG(...

Prime graph of a ring R is a graph whose vertex set is the whole set R any any two elements $x$ and $y$ of $R$ are adjacent in the graph if and only if $xRy = 0$ or $yRx = 0$.  Prime graph of a ring is denoted by $PG(R)$. Directed prime graphs for non-commutative rings and connectivity in the graph are studied in the present paper. The diameter and girth of this graph are also studied in the pa...

In this paper, the composite order Cayley graph Cay(G, S) is introduced, where G is a group and S is the set of all composite order elements of G. Some graph parameters such as diameter, girth, clique number, independence number, vertex chromatic number and domination number are calculated for the composite order Cayley graph of some certain groups. Moreover, the planarity of composite order Ca...

the objective followed in the present study was to survey the relationship between 18 body trait measurements (live weight, height at wither, paunch girth, neck diameter, body length, girth around the body, width of fat tail at above, below and midpoint of fat tail, fat tail length lowers right and left sides, fat tail gap length, fat tail depth at the above, below, and midpoint, and girth arou...

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

An upper bound is given on the minimum distance between i subsets of the same size of a regular graph in terms of the i-th largest eigenvalue in absolute value. This yields a bound on the diameter in terms of the i-th largest eigenvalue, for any integer i. Our bounds are shown to be asymptotically tight. A recent result by Quenell relating the diameter, the second eigenvalue, and the girth of a...