Results 41 to 50 of about 2,421,288 (269)
Communication and Language Profiles of Children Treated for Posterior Fossa Brain Tumors
ABSTRACT Background Cognitive and language deficits are frequently reported sequelae of posterior fossa brain tumors (PFBT). Typically, delayed onset impedes prompt assessment and early intervention. This has devastating implications for quality of life.
Zara Sved +4 more
wiley +1 more source
Maximum Independent Sets in Direct Products of Cycles or Trees with Arbitrary Graphs
The direct product of graphs G = (V (G),E(G)) and H = (V (H),E(H)) is the graph, denoted as G×H, with vertex set V (G×H) = V (G)×V (H), where vertices (x1, y1) and (x2, y2) are adjacent in G × H if x1x2 ∈ E(G) and y1y2 ∈ E(H). Let n be odd and m even. We
Paj Tjaša, Špacapan Simon
doaj +1 more source
The Hilton-Spencer Cycle Theorems Via Katona’s Shadow Intersection Theorem
A family 𝒜 of sets is said to be intersecting if every two sets in 𝒜 intersect. An intersecting family is said to be trivial if its sets have a common element.
Borg Peter, Feghali Carl
doaj +1 more source
ABSTRACT Background The HIT network was established in 2000 to create a population‐based structure aiming to improve survival rates and reduce late effects for children with central nervous system (CNS) tumors by conducting comprehensive clinical trials.
Stefan Rutkowski +59 more
wiley +1 more source
Some Results on the Independence Polynomial of Unicyclic Graphs
Let G be a simple graph on n vertices. An independent set in a graph is a set of pairwise non-adjacent vertices. The independence polynomial of G is the polynomial I(G,x)=∑k=0ns(G,k)xk$I(G,x) = \sum\nolimits_{k = 0}^n {s\left({G,k} \right)x^k }$, where s(
Oboudi Mohammad Reza
doaj +1 more source
Stable sets versus independent sets
The matroidal number \(m(G)\) of a graph \(G\) is defined as the smallest integer \(m\) so that the collection of the stable sets of \(G\) arises as \(I_ 1\cup I_ 2 \cup \cdots \cup I_ m\) where the \(I_ i\) are collections of independent sets of matroids on the vertex set of \(G\).
openaire +2 more sources
ABSTRACT Introduction Characterizing stressful events reported by childhood cancer survivors experienced throughout the lifespan may help improve trauma‐informed care relevant to the survivor experience. Methods Participants included 2552 survivors (54% female; 34 years of age) and 469 community controls (62% female; 33 years of age) from the St.
Megan E. Ware +13 more
wiley +1 more source
Exploiting Interference for Capacity Improvement in Software-Defined Vehicular Networks
Vehicular ad hoc networks (VANETs), which are deployed along roads, make traffic systems safer and more efficient. The existing theoretical results on capacity scaling laws provide insights and guidance for designing and deploying VANETs.
Xin Guan +5 more
doaj +1 more source
Independent point-set domination in line graphs
Line graph of a graph G is an intersection graph of the edge set E(G) of G. In this paper, we obtain a sharp upper bound on the diameter of graph G whose line graph is an ipsd graph (graph possessing an independent point-set dominating set) by ...
Purnima Gupta, Alka Goyal, Ranjana Jain
doaj +1 more source
Abstract Background Sickle cell disease (SCD) is an autosomal recessive hemoglobinopathy affecting millions of individuals worldwide. The clinical expression and psychosocial burden of SCD vary widely across geographical, cultural, and healthcare system contexts, underscoring the need for setting‐specific approaches to assessment.
Desiré Fantasia +7 more
wiley +1 more source

