Results 41 to 50 of about 336,088 (309)
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
ABSTRACT Background Pediatric patients with extracranial solid tumors (ST) receiving chemotherapy are at an increased risk for Pneumocystis jirovecii pneumonia (PJP). However, evidence guiding prophylaxis practices in this population is limited. A PJP‐related fatality at our institution highlighted inconsistent prescribing approaches and concerns about
Kriti Kumar +8 more
wiley +1 more source
Sickle Cell Disease Is an Inherent Risk for Asthma in a Sibling Comparison Study
ABSTRACT Introduction Sickle cell disease (SCD) and asthma share a complex relationship. Although estimates vary, asthma prevalence in children with SCD is believed to be comparable to or higher than the general population. Determining whether SCD confers an increased risk for asthma remains challenging due to overlapping symptoms and the ...
Suhei C. Zuleta De Bernardis +9 more
wiley +1 more source
On the $k$-independence number of graphs
© 2019. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/
Abiad, Aida +2 more
openaire +4 more sources
ABSTRACT The pediatric hematology‐oncology fellowship training curriculum has not substantially changed since its inception. The first year of training is clinically focused, and the second and third years are devoted to scholarship. However, this current structure leaves many fellows less competitive in the current job market, resulting in ...
Scott C. Borinstein +3 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
Psychosocial Outcomes in Patients With Endocrine Tumor Syndromes: A Systematic Review
ABSTRACT Introduction The combination of disease manifestations, the familial burden, and varying penetrance of endocrine tumor syndromes (ETSs) is unique. This review aimed to portray and summarize available data on psychosocial outcomes in patients with ETSs and explore gaps and opportunities for future research and care.
Daniël Zwerus +6 more
wiley +1 more source
Independent Component Analysis and Number of Independent Basis Vectors
AbstractAmong the various biometric systems, face recognition is an important area of research due to its applications in Human Computer Interaction, biometrics and security. It is one of the most popular research areas in the field of computer vision and pattern recognition.
Borade, Sushma Niket +2 more
openaire +1 more source
ABSTRACT Background The Improving Population Outcomes for Renal Tumours of childhood (IMPORT) is a prospective clinical observational study capturing detailed demographic and outcome data on children and young people diagnosed with renal tumours in the United Kingdom and the Republic of Ireland.
Naomi Ssenyonga +56 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

