Results 91 to 100 of about 92,304 (328)
On the Girth of Tanner (3, 13) Quasi-Cyclic LDPC Codes
IEEE Access, 2019 Girth is an important structural property of low-density parity-check (LDPC) codes. Motivated by the works on the girth of Tanner (3, 5), (3, 7), (3, 11), and (5, 7) quasi-cyclic (QC) LDPC codes, we, in this paper, study the girth of Tanner (3, 13) QC ...
Hengzhou Xu +4 more
doaj +1 more source
A Short Proof for a Lower Bound on the Zero Forcing Number
Discussiones Mathematicae Graph Theory, 2020 We provide a short proof of a conjecture of Davila and Kenter concerning a lower bound on the zero forcing number Z(G) of a graph G. More specifically, we show that Z(G) ≥ (g − 2)(δ − 2) + 2 for every graph G of girth g at least 3 and minimum degree δ at
Fürst Maximilian, Rautenbach Dieter
doaj +1 more source
A note on circular chromatic number of graphs with large girth and similar problems [PDF]
, 2014 In this short note, we extend the result of Galluccio, Goddyn, and Hell, which states that graphs of large girth excluding a minor are nearly bipartite.
De Mendez, Patrice Ossona +1 more
core +1 more source
Scan posture definition and hip girth measurement: the impact on clothing design and body scanning
Ergonomics, 2017 Ergonomic measurement is central to product design and development; especially for body worn products and clothing. However, there is a large variation in measurement definitions, complicated by new body scanning technology that captures measurements in ...
S. Gill, C. Parker
semanticscholar +1 more source
Splitting Planar Graphs of Girth 6 into Two Linear Forests with Short Paths [PDF]
Journal of Graph Theory, 2015 Recently, Borodin, Kostochka, and Yancey (Discrete Math 313(22) (2013), 2638–2649) showed that the vertices of each planar graph of girth at least 7 can be 2‐colored so that each color class induces a subgraph of a matching.
M. Axenovich, T. Ueckerdt, Pascal Weiner
semanticscholar +1 more source
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
Remote Sensing in Ecology and Conservation, EarlyView.We present a novel method for the non‐invasive and automatic assessment of harbour seal body condition, using unoccupied aerial vehicles (UAVs/drones), and systematically apply the method to wild seals over 2 years, achieving a near‐population‐level assessment for pups on land (82.5% measured).
Daire Carroll +3 more
wiley +1 more source
Girth Analysis of Tanner’s (3, 17)-Regular QC-LDPC Codes Based on Euclidean Division Algorithm
IEEE Access, 2019 In this paper, the girth distribution of the Tanner’s (3, 17)-regular quasi-cyclic LDPC (QC-LDPC) codes with code length $17p$ is determined, where $p$ is a prime and $p \equiv 1~(\bmod ~51)$ .
Hengzhou Xu +3 more
doaj +1 more source
Biometric relations of freshwater fishes of the Suaza River (Huila Department, Colombia) [PDF]
Acta Ichthyologica et Piscatoria, 2016 The knowledge of freshwater fishes in remote Andean mountains is scarce and restricted to changes of occurrence distribution along a specific gradient.
I. Tobes +3 more
doaj +3 more sources
An entropy based proof of the Moore bound for irregular graphs [PDF]
, 2010 We provide proofs of the following theorems by considering the entropy of random walks: Theorem 1.(Alon, Hoory and Linial) Let G be an undirected simple graph with n vertices, girth g, minimum degree at least 2 and average degree d: Odd girth: If g=2r+1 ...
Babu, S. Ajesh, Radhakrishnan, Jaikumar
core +1 more source