Results 61 to 70 of about 1,125,105 (260)
On the Weak Reconstruction of Strong Product Graphs
We prove that any nontrivial connected strong product graph can be uniquely reconstructed from each of its one vertex deleted subgraphs.
Blaz Zmazek, Janez Zerovnik
openaire +2 more sources
Early Impact of Childhood Opportunity on Neurocognitive Outcomes in Sickle Cell Disease
ABSTRACT Introduction Neurocognitive impairment is a well‐recognized complication of sickle cell disease (SCD) that begins early in childhood and persists across development. While cerebrovascular injury contributes substantially to risk, neurocognitive deficits are also observed in children without overt or silent cerebral infarctions, suggesting ...
Julia E. LaMotte +5 more
wiley +1 more source
Sharp Upper Bounds for Generalized Edge-Connectivity of Product Graphs
The generalized k-connectivity κk(G) of a graph G was introduced by Hager in 1985. As a natural counterpart of this concept, Li et al. in 2011 introduced the concept of generalized k-edge-connectivity which is defined as λk(G) = min{λ(S) : S ⊆ V (G) and |
Sun Yuefang
doaj +1 more source
ABSTRACT Background Adolescents with haematological malignancies face significant emotional and relational challenges, often accompanied by difficulties in communicating their needs within the healthcare context. To address these issues, a narrative‐based psycho‐educational intervention based on the creation and prescription of Ironic Medications was ...
Marta Stoppa +7 more
wiley +1 more source
2-Tone Colorings in Graph Products
A variation of graph coloring known as a t-tone k-coloring assigns a set of t colors to each vertex of a graph from the set {1, . . . , k}, where the sets of colors assigned to any two vertices distance d apart share fewer than d colors in common.
Loe Jennifer +3 more
doaj +1 more source
NZ‐flows in strong products of graphs
AbstractWe prove that the strong product G1⊠ G2 of G1 and G2 is ℤ3‐flow contractible if and only if G1⊠ G2 is not T⊠ K2, where T is a tree (we call T⊠ K2 a K4‐tree). It follows that G1⊠ G2 admits an NZ 3 ‐flow unless G1⊠ G2 is a K4 ‐tree. We also give a constructive proof that yields a polynomial algorithm whose output is an NZ 3‐flow if G1⊠ G2 is not ...
Wilfried Imrich +3 more
openaire +3 more sources
ABSTRACT Objectives The association between exposure to dinutuximab beta (DB) and event‐free survival (EFS) or overall survival (OS) of neuroblastoma patients was assessed using data collected during three clinical trials (five cohorts). Methods A systematic review (March 2026) was conducted to identify relevant studies (prospective; registered DB ...
Przemysław Holko +19 more
wiley +1 more source
若干运算图的倍乘赋权Harary指标(Multiplicatively weighted Harary index of some graph operations)
Recently, ALIZADEH et al proposed a modification of the Harary index in which the contributions of vertex pairs were weighted by the product of their degrees.
WENYanqing(温艳清) +2 more
doaj +1 more source
Fast recognition of direct and strong products
Summary: This note describes fast algorithms for computing the prime factors of connected, nonbipartite graphs with respect to the direct product, and of connected graphs with respect to the strong product. The complexities are \(O(m \min(n^{2} {\Delta}^{3}))\) for the direct product, and \(O(m\,a(G) \Delta)\) for the strong, where \(n\) is the order ...
Hammack, Richard H., Imrich, Wilfried
openaire +4 more sources
ABSTRACT Background Medication nonadherence during the first 100 days after pediatric hematopoietic stem cell transplantation (HSCT) and during oncology treatment increases risk for complications. BMT4me is a caregiver‐facing mobile health (mHealth) application providing medication reminders, symptom tracking, and note‐taking features to support ...
Micah A. Skeens +4 more
wiley +1 more source

