Results 161 to 170 of about 92,304 (328)
On vertex-girth-regular graphs: (Non-)existence, bounds and enumeration [PDF]
arXivA vertex-girth-regular $vgr(v,k,g,\lambda)$-graph is a $k$-regular graph of girth $g$ and order $v$ in which every vertex belongs to exactly $\lambda$ cycles of length $g$. While all vertex-transitive graphs are necessarily vertex-girth-regular, the majority of vertex-girth-regular graphs are not vertex-transitive. Similarly, while many of the smallest
arxiv
Using citizen science photographs to identify reproductive events in an oviparous elasmobranch
Journal of Fish Biology, EarlyView.Abstract Identifying critical habitats is important for the effective management of vulnerable species. Critical habitats, such as mating or nursery grounds, support populations during key life stages and help to maximise reproductive output and population growth. In elasmobranchs, mating often happens over a defined season, suggesting sites associated
Rachel Mawer +4 more
wiley +1 more source
On the girth of Tanner (3,7) quasi-cyclic LDPC codes [PDF]
Transactions on Combinatorics, 2012 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 (
Mohammad Gholami +1 more
doaj
Epidermal scale growth, allometry and function in non‐avian dinosaurs and extant reptiles
Journal of Anatomy, EarlyView.Scale shapes in non‐avian dinosaurs and extant reptiles are mostly retained through growth. However, positive scale allometry and proportional differences in scale breadth are also detected, which are likely associated with changing body proportions. Based on their generally conserved morphology and impracticality for visual display, the enlarged size ...
Nathan James Enriquez +3 more
wiley +1 more source
L(2, 1)-Labelings of Some Families of Oriented Planar Graphs
Discussiones Mathematicae Graph Theory, 2014 In this paper we determine, or give lower and upper bounds on, the 2-dipath and oriented L(2, 1)-span of the family of planar graphs, planar graphs with girth 5, 11, 16, partial k-trees, outerplanar graphs and cacti.
Sen Sagnik
doaj +1 more source
Analytical lower bounds for the size of elementary trapping sets of variable-regular LDPC codes with any girth and irregular ones with girth 8 [PDF]
arXiv, 2017 In this paper we give lower bounds on the size of $(a,b)$ elementary trapping sets (ETSs) belonging to variable-regular LDPC codes with any girth, $g$, and irregular ones with girth 8, where $a$ is the size, $b$ is the number of degree-one check nodes and satisfy the inequality $\frac{b}{a}<1$.
arxiv
Journal of Clinical Nursing, EarlyView.ABSTRACT Background Parastomal hernia or bulging is a long‐recognised complication in relation to a stoma. Around half of patients develop a parastomal bulge and up to 75% experience symptoms. Only a minority is offered surgical treatment; thus, most patients manage the bulge on their own or by interventions provided by stoma care nurses.
Cecilie Larsen +4 more
wiley +1 more source
Light Graphs In Planar Graphs Of Large Girth
Discussiones Mathematicae Graph Theory, 2016 A graph H is defined to be light in a graph family 𝒢 if there exist finite numbers φ(H, 𝒢) and w(H, 𝒢) such that each G ∈ 𝒢 which contains H as a subgraph, also contains its isomorphic copy K with ΔG(K) ≤ φ(H, 𝒢) and ∑x∈V(K) degG(x) ≤ w(H, 𝒢).
Hudák Peter +3 more
doaj +1 more source
Proof of the High Girth Existence Conjecture via Refined Absorption [PDF]
arXivWe prove the High Girth Existence Conjecture - the common generalization of the Existence Conjecture for Combinatorial Designs originating from the 1800s and Erd\H{o}s' Conjecture from 1973 on the Existence of High Girth Steiner Triple Systems.
arxiv