Results 51 to 60 of about 72,244 (231)
Rubber tree cultivation [Hevea brasiliensis (Willd. ex Adr. de Juss.) Muell.-Arg.] uses mostly the budding propagation method, however the expected stand uniformity due to the use of vegetative propagation is theoretical, since high variation for yield ...
Átila Bento Beleti Cardinal +2 more
doaj +1 more source
The Independence Ratio of 4‐Cycle‐Free Planar Graphs
ABSTRACT We prove that every n $n$‐vertex planar graph G $G$ with no triangle sharing an edge with a 4‐cycle has independence ratio n ∕ α ( G ) ≤ 4 − ε $n\unicode{x02215}\alpha (G)\le 4-\varepsilon $ for ε = 1 ∕ 30 $\varepsilon =1\unicode{x02215}30$. This result implies that the same bound holds for 4‐cycle‐free planar graphs and planar graphs with no ...
Tom Kelly +3 more
wiley +1 more source
On the annihilator graphs of partial transformation semigroups
Let [Formula: see text] and [Formula: see text] be a partial transformation semigroup on [Formula: see text] Obviously, the empty set [Formula: see text] is a zero element of [Formula: see text] and denoted by 0.
Chollawat Pookpienlert +2 more
doaj +1 more source
An entropy based proof of the Moore bound for irregular graphs [PDF]
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
A lower bound on the order of the largest induced forest in planar graphs with high girth
We give here new upper bounds on the size of a smallest feedback vertex set in planar graphs with high girth. In particular, we prove that a planar graph with girth $g$ and size $m$ has a feedback vertex set of size at most $\frac{4m}{3g}$, improving the
Dross, François +2 more
core +2 more sources
Abstract Background Balloon gastrostomy tube (BGT) placements are increasing due to their ability to facilitate care of medically complex children. Management for routine and nonroutine tube replacement, including verification of proper replacement, lacks standardization, varying widely among different institutions and settings.
Beth Lyman +15 more
wiley +1 more source
THE TRIPLE IDEMPOTENT GRAPH OF THE RING Z_n
Let be a commutative ring, and denote the set of all idempotent elements of . The triple idempotent graph of , denoted by , is defined as an undirected simple graph whose vertex set .
Vika Yugi Kurniawan +2 more
doaj +1 more source
Near-colorings: non-colorable graphs and NP-completeness [PDF]
A graph G is (d_1,..,d_l)-colorable if the vertex set of G can be partitioned into subsets V_1,..,V_l such that the graph G[V_i] induced by the vertices of V_i has maximum degree at most d_i for all 1
Montassier, Mickael, Ochem, Pascal
core
Abstract Purpose The purpose of this study was to determine whether there was an association between preoperative Kellgren–Lawrence (KL) grade and long‐term failure rates, reoperation free survival rates, and patient reported outcomes of patients undergoing medial meniscal posterior root repair (MMPRR).
Dan Cohen +7 more
wiley +1 more source
THE TRIPLE IDENTITY GRAPH OF THE RING Z_n
Let be a commutative ring with identity and is an identity element of . The triple identity graph of the ring , represented by ), is an undirected simple graph with the vertex set .
Vika Yugi Kurniawan +2 more
doaj +1 more source

