نتایج جستجو برای: girth
تعداد نتایج: 2923 فیلتر نتایج به سال:
LDPC codes are serious contenders to Turbo codes in terms of decoding performance. One of the main problems is to give an explicit construction of such codes whose Tanner graphs have known girth. For a prime power q and m ≥ 2, Lazebnik and Ustimenko construct a q-regular bipartite graph D(m, q) on 2qm vertices, which has girth at least 2dm/2e+ 4. We regard these graphs as Tanner graphs of binar...
A novel method guaranteeing nondecreasing girth is presented for constructing longer low-density parity-check (LDPC) codes from shorter ones. The parity-check matrix of a shorter base code is decomposed into N (N ≥ 2) nonoverlapping components with the same size. Then, these components are combined together to form the parity-check matrix of a longer code, according to a given N×N Latin square....
Partial cubes are graphs isometrically embeddable into hypercubes. We analyze how isometric cycles in partial cubes behave and derive that every partial cube of girth more than six must have vertices of degree less than three. As a direct corollary we get that every regular partial cube of girth more than six is an even cycle. Along the way we prove that every partial cube G with girth more tha...
Partial cubes are graphs isometrically embeddable into hypercubes. We analyze how isometric cycles in partial cubes behave and derive that every partial cube of girth more than six must have vertices of degree less than three. As a direct corollary we get that every regular partial cube of girth more than six is an even cycle. Along the way we prove that every partial cube G with girth more tha...
We describe a sufficient condition for graphs used in a construction of Thomassen (which yields hypohamiltonian graphs) to produce maximally non-hamiltonian (MNH) graphs as well. Then we show that the Coxeter graph fulfils this sufficient condition, and thus applying the Thomassen’s construction to multiple copies of the Coxeter graph yields infinitely many MNH graphs with girth 7. So far, the ...
let $r$ be a commutative ring with identity and $m$ an $r$-module. in this paper, we associate a graph to $m$, say ${gamma}({}_{r}m)$, such that when $m=r$, ${gamma}({}_{r}m)$ coincide with the zero-divisor graph of $r$. many well-known results by d.f. anderson and p.s. livingston have been generalized for ${gamma}({}_{r}m)$. we show that ${gamma}({}_{r}m)$ is connected with ${diam}({gamma}({}_...
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 $(3,7)$ codes of length $7p$, where $p$ is a prime of the form $21m+ 1$, the girth values of tanner $(3,7...
We consider the complexity of oriented homomorphism and two of its variants, namely strong oriented homomorphism and pushable homomorphism, for planar graphs with large girth. In each case, we consider the smallest target graph such that the corresponding homomorphism is NP-complete. These target graphs T4, T5, and T6 have 4, 5, and 6 vertices, respectively. For i ∈ {4, 5, 6} and for every g, w...
Let H be a xed graph. We show that any H-minor free graph of high enough girth has a circular-chromatic number arbitrarily close to two. Equivalently, such graphs have homomorphisms into a large odd circuit. In particular, graphs of high girth and of bounded genus or bounded tree width are \nearly bipartite" in this sense. For example, any planar graph of girth at least 16 admits a homomorphism...
We introduce a new way to tabulate knots by representing knot diagrams using a pair of planar trees. This pair of trees have their edges labeled by integers, they have no valence 2 vertices, and they have the same number of valence 1 vertices. The number of valence 1 vertices of the trees is called the girth of the knot diagram. The classification problem of knots admitting girth 2 and 3 diagra...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید