Results 71 to 80 of about 72,244 (231)
On Almost Well-Covered Graphs of Girth at Least 6
, 2018 We consider a relaxation of the concept of well-covered graphs, which are graphs with all maximal independent sets of the same size. The extent to which a graph fails to be well-covered can be measured by its independence gap, defined as the difference ...
Ekim, Tınaz +3 more
core +1 more source
BJOG: An International Journal of Obstetrics &Gynaecology, EarlyView.ABSTRACT Objective The Guidance for International Growth Standards (GIGS) project aims to improve and promote appropriate application of international growth standards across clinical, research and public health settings. Design A guidance document providing historical and conceptual context to support the appropriate application of international ...
Eric O. Ohuma +4 more
wiley +1 more source
Graphical small cancellation groups with the Haagerup property [PDF]
, 2014 We prove the Haagerup property (= Gromov's a-T-menability) for finitely generated groups defined by infinite presentations satisfying the graphical C'(lambda)-small cancellation condition with respect to graphs endowed with a compatible wall structure ...
Arzhantseva, Goulnara, Osajda, Damian
core
BJU International, EarlyView.Objectives To provide a comprehensive summary of the surgical outcomes of Zephyr Surgical Implants (ZSI; Geneva, Switzerland) hydraulic and malleable female‐to‐male (FTM) penile implants (PIs) in transgender patients. Patients and Methods All transgender patients who underwent hydraulic (ZSI FTM 475) and malleable (ZSI FTM 100) erectile device ...
Maya Levy +6 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
Low Density Parity Check Codes Constructed from Hankel Matrices
Journal of Telecommunications and Information Technology, 2018 In this paper, a new technique for constructing low density parity check codes based on the Hankel matrix and circulant permutation matrices is proposed. The new codes are exempt of any cycle of length 4.
Mohammed Amine Tehami
doaj +1 more source
Large-Girth Roots of Graphs [PDF]
SIAM Journal on Discrete Mathematics, 2010 14 pages, 4 ...
Adamaszek, Anna, Adamaszek, Michal
openaire +4 more sources
BJU International, EarlyView.Objective To compare the long‐term outcomes of the two main types of malleable erectile implants after phalloplasty in transgender men: models originally designed for cisgender men (conventional models) or the more recently developed Zephyr Surgical Implants (Geneva, Switzerland) female‐to‐male 100 implant (ZSI FtM 100) specifically for phalloplasty ...
Maya Levy +5 more
wiley +1 more source
The Relationship Between Stature and Live Weight of Dairy Cows Between Birth and Maturity
RuminantsLactational and reproductive performance are strongly associated with cow live weight and capacity. However, there are limited data published describing capacity (thoracic) growth and the prediction of final stature and capacity from measurements at ...
Michaela J. Gibson +5 more
doaj +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