Results 61 to 70 of about 2,700 (119)

On Regular Hypergraphs of High Girth [PDF]

The Electronic Journal of Combinatorics, 2014
We give lower bounds on the maximum possible girth of an $r$-uniform, $d$-regular hypergraph with at most $n$ vertices, using the definition of a hypergraph cycle due to Berge. These differ from the trivial upper bound by an absolute constant factor (viz., by a factor of between $3/2+o(1)$ and $2 +o(1)$).
ELLIS, DC, Linial, N
openaire   +3 more sources

The Relationship Between Stature and Live Weight of Dairy Cows Between Birth and Maturity

Ruminants
Lactational and reproductive performance are strongly associated with cow live weight and capacity. However, there are limited data published describing capacity (thoracic) growth and the prediction of final stature and capacity from measurements at ...
Michaela J. Gibson, Nick W. Sneddon, Chris W. Rogers, Penny J. Back, Keren E. Dittmer, Natalia P. Martín   +5 more
doaj   +1 more source

On the girth of Tanner (3,7) quasi-cyclic LDPC codes [PDF]

Transactions on Combinatorics, 2012
S. Kim, et al, have been analyzed the girth of some algebraically structured quasi-cyclic (QC) low-density parity-check (LDPC) codes, i.e. Tanner (3,5) of length 5p, where p is a prime of the form 15m+1. In this paper, by extension this method to Tanner (
Mohammad Gholami, Fahime Sadat Mostafaiee   +1 more
doaj  

On the girth of infinite graphs

Discrete Mathematics, 1993
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Some Metrical Properties of Lattice Graphs of Finite Groups

Mathematics, 2019
This paper is concerned with the combinatorial facts of the lattice graphs of Z p 1 × p 2 × ⋯ × p m , Z p 1 m 1 × p 2 m 2 , and Z p 1 m 1 × p 2 m 2 × p 3 1 .
Jia-Bao Liu, Mobeen Munir, Qurat-ul-Ain Munir, Abdul Rauf Nizami   +3 more
doaj   +1 more source

THE UNIT GRAPH OF A COMMUTATIVE SEMIRING [PDF]

Journal of Algebraic Systems
Let S be a commutative semiring with unity and U(S) be the set of all units of S. The unit graph of S, denoted by G(S), is the undirected graph with vertex set S and two distinct vertices x and y are adjacent if and only if x + y ∈ U(S). In this article,
Laithun Boro, Madan Singh, Jituparna Goswami   +2 more
doaj   +1 more source

Carbon sequestration by different tree species in tropical dry deciduous forest of Panchmahal District (Gujarat) in India

Environment Conservation Journal, 2014
Trees act as a sink for CO2 by fixing carbon during photosynthesis and storing surplus carbon as biomass which alter through time as trees grow, die and decay. There is uncertainty about the extent of carbon stored in forests by trees.
P.K. Pilania , R.V. Gujar, N.S. Panchal   +2 more
doaj   +1 more source

A New Method for Building Low-Density-Parity-Check Codes

International Journal of Technology, 2019
This paper proposes a new method for building low-density-parity-check codes, exempt of cycle of length 4, based on a circulant permutation matrix, which needs very little memory for storage it in the encoder and a dual diagonal structure is applied ...
Tehami Mohammed Amine, Djebbari Ali
doaj   +1 more source

Girth of pancake graphs

Discrete Applied Mathematics, 2011
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Maximum Genus, Girth and Connectivity

European Journal of Combinatorics, 2000
This paper examines the relationship between the maximum genus of a simple graph and its girth and connectivity. Some general upper bounds are given in terms of the Betti number of the graph. Lower bounds are given for girths 3 through 10 and 12 using the known values for the minimum number of cubic vertices in a graph of given girth.
Deming Li, Yanpei Liu
openaire   +1 more source