Results 41 to 50 of about 9,781,779 (300)
Clique immersions and independence number
13 pages, 1 figure.
Sebastián Bustamante 0001 +3 more
openaire +3 more sources
ABSTRACT Background Children with sickle cell anemia (SCA) in low‐income settings are at risk of severe malnutrition, but optimal nutritional management has not been established. We evaluated an intensified ready‐to‐use therapeutic food (RUTF) regimen in children with persistent severe malnutrition after initial treatment and assessed whether early ...
Safiya Gambo +9 more
wiley +1 more source
A note on subspace sum graph of vector spaces
For a finite dimensional vector space over a field the subspace sum graph of denoted by is defined to be a simple undirected graph with vertex set as the set of all non-trivial proper subspace of and, for any two distinct vertices V1 and V2 are adjacent ...
Ramanathan Venkatasalam +1 more
doaj +1 more source
On subgraph number independence in trees
AbstractFor finite graphs F and G, let NF(G) denote the number of occurrences of F in G, i.e., the number of subgraphs of G which are isomorphic to F. If F and G are families of graphs, it is natural to ask then whether or not the quantities NF(G), F∈F, are linearly independent when G is restricted to G.
Ronald L. Graham, Endre Szemerédi
openaire +1 more source
ABSTRACT Rates of cancer among adolescents and young adults (AYA), age 15–39 years, are increasing. Consequently, radiation oncologists are treating more AYAs who have diagnoses spanning both pediatric and adult practices. Compared to pediatric and older adult patients, AYAs face a unique set of challenges.
Hesham Elhalawani +7 more
wiley +1 more source
ABSTRACT Background Survivors of pediatric brain tumors (PBTs) can experience long‐term social difficulties, impacting quality of life. Beyond medical and environmental factors, family psychosocial risk may play a role in social outcomes by shaping the caregiving environment and may provide intervention options.
Renske H. Houben +4 more
wiley +1 more source
Independent Transversal Total Domination Versus Total Domination in Trees
A subset of vertices in a graph G is a total dominating set if every vertex in G is adjacent to at least one vertex in this subset. The total domination number of G is the minimum cardinality of any total dominating set in G and is denoted by γt(G).
Martínez Abel Cabrera +2 more
doaj +1 more source
ABSTRACT Background Allogeneic hematopoietic stem cell transplantation (alloHSCT) is an essential therapy for several malignant and nonmalignant diseases, but relapse and graft loss remain the principal threats to its success. Routine monitoring of chimerism and minimal residual disease (MRD) enables early detection of imminent recurrence and guides ...
Carmen Junk +10 more
wiley +1 more source
City of Independence transportation system plan [PDF]
246 pp. Bookmarks supplied by UO. Includes maps and figures. Published June, 2007. Captured February 1, 2008.The Independence Transportation System Plan (TSP) establishes the City’s goals, policies and action strategies for developing and improving the ...
Independence (Or.), Parametrix, Inc.
core +1 more source
Independence Number and Packing Coloring of Generalized Mycielski Graphs
For a positive integer k ⩾ 1, a graph G with vertex set V is said to be k-packing colorable if there exists a mapping f : V ↦ {1, 2, . . ., k} such that any two distinct vertices x and y with the same color f(x) = f(y) are at distance at least f(x) + 1 ...
Bidine Ez Zobair +2 more
doaj +1 more source

