Results 11 to 20 of about 16,859 (164)
Lower Bounds on the Lifting Degree of QC-LDPC Codes by Difference Matrices
IEEE Access, 2018 In this paper, we define two “difference matrices” which correspond to an exponent matrix. We present necessary and sufficient conditions for these difference matrices to have quasi-cyclic low-density parity-check codes (QC-LDPC) codes with
Farzane Amirzade, Mohammad-Reza Sadeghi
doaj +1 more source
A Note on the Girth of (3, 19)-Regular Tanner’s Quasi-Cyclic LDPC Codes
IEEE Access, 2021 In this article, we study the cycle structure of (3, 19)-regular Tanner’s quasi-cyclic (QC) LDPC codes with code length $19p$ , where $p$ is a prime and $p\equiv 1~(\bmod ~57)$ , and transform the conditions for the existence of cycles of ...
Manjie Zhou +4 more
doaj +1 more source
Dairy, 2022 Selection pressure for greater milk solid production, calving ease and early puberty attainment has resulted in the alteration of the growth trajectory of New Zealand dairy heifers.
Michaela J. Gibson +5 more
doaj +1 more source
On Some Properties of Antipodal Partial Cubes
Discussiones Mathematicae Graph Theory, 2020 We prove that an antipodal bipartite graph is a partial cube if and only it is interval monotone. Several characterizations of the principal cycles of an antipodal partial cube are given.
Polat Norbert
doaj +1 more source
Modèle de croissance pour les plantations de mélèzes [PDF]
Biotechnologie, Agronomie, Société et Environnement, 2003 Growth model forlarch in pure and even-aged stands. Adistance independent tree growth model has been determined forpure and even-aged larch stands (Larix sp.) growing in Walloon Region (South Belgium).
Rondeux J., Lejeune P., Pauwels D.
doaj
On General Reduced Second Zagreb Index of Graphs
Mathematics, 2022 Graph-based molecular structure descriptors (often called “topological indices”) are useful for modeling the physical and chemical properties of molecules, designing pharmacologically active compounds, detecting environmentally hazardous substances, etc.
Lkhagva Buyantogtokh +2 more
doaj +1 more source
Number of cycles of small length in a graph
AKCE International Journal of Graphs and Combinatorics, 2023 Let G be a simple undirected graph. In this article, we obtain an explicit formula for the number of 8-cycles in G in terms of the entries of its adjacency matrix. We provide new formulae to find the number of cycles of length 4, 5 and 6 in G.
Sasmita Barik, Sane Umesh Reddy
doaj +1 more source
Scientia Agricola, 2007 Rubber tree cultivation [Hevea brasiliensis (Willd. ex Adr. de Juss.) Muell.-Arg.] uses mostly the budding propagation method, however the expected stand uniformity due to the use of vegetative propagation is theoretical, since high variation for yield ...
Átila Bento Beleti Cardinal +2 more
doaj +1 more source
Diameter and girth of Torsion Graph
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2014 Let R be a commutative ring with identity. Let M be an R-module and T (M)* be the set of nonzero torsion elements. The set T(M)* makes up the vertices of the corresponding torsion graph, ΓR(M), with two distinct vertices x, y ∈ T(M)* forming an edge if ...
Rad P. Malakooti +3 more
doaj +1 more source
Characterization of classes of graphs with large general position number
AKCE International Journal of Graphs and Combinatorics, 2020 Getting inspired by the famous no-three-in-line problem and by the general position subset selection problem from discrete geometry, the same is introduced into graph theory as follows.
Elias John Thomas, Ullas Chandran S. V.
doaj +1 more source