نتایج جستجو برای: girth

تعداد نتایج: 2923  

Journal: :Discrete Mathematics 2012
Marien Abreu Gabriela Araujo-Pardo Camino Balbuena Domenico Labbate

In this paper we obtain (q + 3)–regular graphs of girth 5 with fewer vertices than previously known ones for q = 13, 17, 19 and for any prime q ≥ 23 performing operations of reductions and amalgams on the Levi graph Bq of an elliptic semiplane of type C. We also obtain a 13–regular graph of girth 5 on 236 vertices from B11 using the same technique.

2010
Asima Amin

A study was carried out in mungbean Vigna radiata (L.) Wilczek) with eight ‘lines’ and four ‘testers’ crossed in a Line x Tester Genetic variability, heritability and genetic advance were estimated for marketable and its component yield traits in 48 lines of carrot (Daucus carota var. sativa L.). The study showed high ranges for total yield (3.15 -7.56 kg/plot), marketable yield (2.60 – 6.85 kg...

Journal: :CoRR 2017
Farzane Amirzade Mohammad-Reza Sadeghi

In this paper, we define two matrices named as “difference matrices”, denoted by D and DD which significantly contribute to achieve regular single-edge QC-LDPC codes with the shortest length and the certain girth as well as regular and irregular multiple-edge QC-LDPC codes. Making use of these matrices, we obtain necessary and sufficient conditions to have single-edge (m,n)-regular QC-LDPC code...

2015
Mahshid Saghazadeh Naruki Kitano Tomohiro Okura

BACKGROUND Knowledge of gender differences in foot shape assists shoe manufactures with designing appropriate shoes for men and women. Although gender differences in foot shapes are relatively known among young men and women, less is known about how the older men and women's feet differ in shape. A recent development in foot shape assessment is the use of 3D foot scanners. To our knowledge this...

Journal: :CoRR 2015
Jan Goedgebeur Oliver Schaudt

We describe an algorithm for generating all k-critical H-free graphs, based on a method of Hoàng et al. Using this algorithm, we prove that there are only finitely many 4-critical (P7, Ck)-free graphs, for both k = 4 and k = 5. We also show that there are only finitely many 4-critical graphs (P8, C4)free graphs. For each case of these cases we also give the complete lists of critical graphs and...

2009
SERKAN OZKAYA YALCIN BOZKURT

The objective of this study was to determine the accuracy of prediction of body weight from body measurements in beef cattle. Wither height, chest girth, body length, chest depth, hip width and hip height measurements were obtained from Holstein, Brown Swiss and crossbred (n=140). Determination coefficients (R2) of regression equation that included all body measurements were higher in Brown Swi...

Journal: :CoRR 2017
Ian Blake Shu Lin

ABSTRACT. A number of recent works have used a variety of combinatorial constructions to derive Tanner graphs for LDPC codes and some of these have been shown to perform well in terms of their probability of error curves and error floors. Such graphs are bipartite and many of these constructions yield biregular graphs where the degree of left vertices is a constant c+1 and that of the right ver...

Journal: :Random Struct. Algorithms 2008
Antar Bandyopadhyay David Gamarnik

In this article we propose new methods for computing the asymptotic value for the logarithm of the partition function (free energy) for certain statistical physics models on certain type of finite graphs, as the size of the underlying graph goes to infinity. The two models considered are the hard-core (independent set) model when the activity parameter λ is small, and also the Potts (q-coloring...

2011
R.B. Kayastha G. Zaman R.N. Goswami A. Haque

The present investigation was undertaken to study the physical and morphometric characteristics in indigenous cattle of Assam. The data pertain to 339 indigenous cattle of different categories. The physical characteristics included colour pattern of body coat, muzzle, tail switch, hoof and horn. Body length, height at wither, heart girth, pouch girth, length of tail, switch, neck, ear and head ...

1996
Zdeněk Dvořák Riste Škrekovski Martin Tancer

The problem of colouring the square of a graph naturally arises in connection with the distance labelings, which have been studied intensively. We consider this problem for sparse subcubic graphs. We show that the choosability χ (G2) of the square of a subcubic graph G of maximum average degree d is at most four if d < 24/11 and G does not contain a 5-cycle, χ (G2) is at most five if d < 7/3 an...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید