Results 51 to 60 of about 390,323 (304)
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background Sickle cell disease (SCD) is a chronic, inherited hemoglobinopathy that requires frequent hospitalization for disease‐related complications. Canadian data on inpatient care is limited. This study compared caregiver‐reported hospital experiences of children with SCD to those with cystic fibrosis (CF), a chronic, autosomal recessive ...
Hailey M. Zwicker +11 more
wiley +1 more source
Independence Number and Packing Coloring of Generalized Mycielski Graphs
Discussiones Mathematicae Graph Theory, 2021 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
Hamiltonicity, independence number, and pancyclicity
European Journal of Combinatorics, 2012 A graph on n vertices is called pancyclic if it contains a cycle of length l for all 3 \le l \le n. In 1972, Erdos proved that if G is a Hamiltonian graph on n > 4k^4 vertices with independence number k, then G is pancyclic. He then suggested that n = Ω(k^2) should already be enough to guarantee pancyclicity.
Choongbum Lee, Benny Sudakov
openaire +2 more sources
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background Osteosarcoma (OS) and Ewing sarcoma (EWS) are the most common primary bone cancers in children, but acute thrombosis is poorly characterized in this population. Our study evaluated the rates of venous thromboembolism (VTE) and associated risk factors in pediatric patients with bone sarcomas treated over a 10‐year period encompassing
Sarah Kappa +8 more
wiley +1 more source
On the Total Graph of Mycielski Graphs, Central Graphs and Their Covering Numbers
Discussiones Mathematicae Graph Theory, 2013 The technique of counting cliques in networks is a natural problem. In this paper, we develop certain results on counting of triangles for the total graph of the Mycielski graph or central graph of star as well as completegraph families.
Patil H.P., Pandiya Raj R.
doaj +1 more source
Two Degree Distance Based Topological Indices of Chemical Trees
IEEE Access, 2019 Let G = (VG, EG) be a simple and connected graph. The eccentric connectivity index of G is represented as ξc(G) = Σx∈VG degG(x)ecG(x), where degG(x) and ecG(x) represent the degree and the eccentricity of x, respectively.
Shehnaz Akhter
doaj +1 more source
New Results Relating Independence and Matchings
Discussiones Mathematicae Graph Theory, 2022 In this paper we study relationships between the matching number, written µ(G), and the independence number, written α(G).
Caro Yair, Davila Randy, Pepper Ryan
doaj +1 more source
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background Children with acute lymphoblastic leukemia (ALL) are at risk of severe outcomes from SARS‐CoV‐2 (SCV2). In the post‐pandemic context, where most children have been infected with SCV2, there are limited data on whether vaccination remains beneficial in children with ALL.
Janna R. Shapiro +11 more
wiley +1 more source
Therapeutic Apheresis and Dialysis, EarlyView.ABSTRACT Objective To compare the efficacy and safety of roxarestat versus recombinant human erythropoietin (rhEPO) in the management of renal anemia in patients undergoing maintenance hemodialysis. Methods This was a prospective, open‐label, randomized controlled trial.
Lingling Chen, Junjie Zhu, Qiaonan Ge
wiley +1 more source
On Generalized Sierpiński Graphs
Discussiones Mathematicae Graph Theory, 2017 In this paper we obtain closed formulae for several parameters of generalized Sierpiński graphs S(G, t) in terms of parameters of the base graph G. In particular, we focus on the chromatic, vertex cover, clique and domination numbers.
Rodríguez-Velázquez Juan Alberto +2 more
doaj +1 more source