Results 61 to 70 of about 9,407,399 (300)
Pediatric Blood &Cancer, EarlyView.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
On the broadcast independence number of circulant graphs
Discrete Mathematics, Algorithms and Applications, 2023 An independent broadcast on a graph [Formula: see text] is a function [Formula: see text] such that (i) [Formula: see text] for every vertex [Formula: see text], where [Formula: see text] denotes the diameter of [Formula: see text] and [Formula: see text] the eccentricity of vertex [Formula: see text], and (ii) [Formula: see text] for every two ...
Abdelamin Laouar +2 more
openaire +3 more sources
Independence Notice of Adopted Amendment (2011-11-18)
, 2011 28 pp. Adopted 2011-11-18. Department of Land Conservation and Development Notice of Adopted AmendmentAmended the Comprehensive Plan Map designation from Industrial to Commercial and changed zoning from Light Industrial (IL) to Mixed Use Pedestrian ...
Independence (Or.)
core +1 more source
Pediatric Blood &Cancer, EarlyView.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
Rainbow Connection Number and Independence Number of a Graph [PDF]
Graphs and Combinatorics, 2016 Let $G$ be an edge-colored connected graph. A path of $G$ is called rainbow if its every edge is colored by a distinct color. $G$ is called rainbow connected if there exists a rainbow path between every two vertices of $G$. The minimum number of colors that are needed to make $G$ rainbow connected is called the rainbow connection number of $G$, denoted
Jiuying Dong, Xueliang Li 0001
openaire +4 more sources
Pediatric Blood &Cancer, EarlyView.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
Independence : Urban renewal plan report
, 2001 Item contains three files: 1) Urban Renewal Plan. 9 pp.; 2) Urban Renewal Plan Report. 9 pp.; 3) Urban Renewal Plan Boundary Map. 1 p. Bookmarks supplied by UO. Adopted September 25, 2001.
Independence (Or.)
core +1 more source
Therapeutic Apheresis and Dialysis, EarlyView.ABSTRACT Background Therapeutic apheresis (TA) is an established treatment modality for hematologic, neurologic, and immunologic disorders, yet access remains severely limited in sub‐Saharan Africa. Donor apheresis, including platelet apheresis collection from healthy donors, represents an important complementary modality supporting blood product ...
Nosa Bazuaye +33 more
wiley +1 more source
The independence numbers of fullerenes and benzenoids
European Journal of Combinatorics, 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Some results on the independence number of connected domination critical graphs
AKCE International Journal of Graphs and Combinatorics, 2018 A --critical graph is a graph with connected domination number and for any pair of non-adjacent vertices and of . Let and be respectively the clique number and the independence number of a graph.
P. Kaemawichanurat, T. Jiarasuksakun
doaj +1 more source