Results 31 to 40 of about 57,717 (241)
The 6-girth-thickness of the complete graph
The g-girth-thickness of a graph G is the minimum number of planar subgraphs of girth at least g whose union is G. In this paper, we determine the 6-girth-thickness of the complete graph Kn in almost all cases.
Héctor Castañeda-López +4 more
doaj +1 more source
Some bounds on the modified Randic index [PDF]
In this paper, we present some new lower and upper bounds for the modified Randic index in terms of maximum, minimum degree, girth, algebraic connectivity, diameter and average distance.
Mahsa Hemmasi, Ali Iranmanesh
doaj +1 more source
Equitable Coloring of IC-Planar Graphs with Girth g ≥ 7
An equitable k-coloring of a graph G is a proper vertex coloring such that the size of any two color classes differ at most 1. If there is an equitable k-coloring of G, then the graph G is said to be equitably k-colorable.
Danjun Huang, Xianxi Wu
doaj +1 more source
Radius, girth and minimum degree [PDF]
AbstractThe objective of the present paper is to study the maximum radius of a connected graph of order , minimum degree and girth at least . Erdős, Pach, Pollack and Tuza proved that if , that is, the graph is triangle‐free, then , and noted that up to the value of the additive constant, this upper bound is tight.
Vojtech Dvorák +3 more
openaire +4 more sources
Fat distribution in men of different waist girth, fitness level and exercise habit [PDF]
Background: The risk of chronic disease is lower in obese men who are fit and active than obese men who are unfit and inactive. Methods/Objectives: Magnetic resonance imaging and spectroscopy were used to assess total and regional adipose tissue in 13
J Fitzpatrick +17 more
core +1 more source
In the paper, the effect of welding technology on the microstructure and mechanical properties of girth welded joints was presented. Metallographic examinations based on light microscopy and SEM were conducted on girth welded joints of API X70 steel pipe.
M. Węglowski +6 more
semanticscholar +1 more source
Planar graphs with girth at least 5 are (3, 4)-colorable [PDF]
A graph is ( d 1 , … , d k ) -colorable if its vertex set can be partitioned into k nonempty subsets so that the subgraph induced by the i th part has maximum degree at most d i for each i ∈ { 1 , … , k } .
Ilkyoo Choi, Gexin Yu, Xia Zhang
semanticscholar +1 more source
Girth 5 graphs from relative difference sets [PDF]
We consider the problem of construction of graphs with given degree and girth 5 and as few vertices as possible. We give a construction of a family of girth 5 graphs based on relative difference sets.
Jørgensen, Leif Kjær
core +6 more sources
Lower Bounds on the Lifting Degree of QC-LDPC Codes by Difference Matrices
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
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

