Results 61 to 70 of about 10,152,062 (308)
Game matching number of graphs
We study a competitive optimization version of $α'(G)$, the maximum size of a matching in a graph $G$. Players alternate adding edges of $G$ to a matching until it becomes a maximal matching. One player (Max) wants that matching to be large; the other (Min) wants it to be small. The resulting sizes under optimal play when Max or Min starts are denoted $
Daniel W. Cranston +3 more
openaire +2 more sources
Graphs with Total Domination Number Double of the Matching Number
A subset $S$ of vertices of a graph $G$ with no isolated vertex is called a total dominating set of $G$ if each vertex of $G$ has at least one neighbor in the set $S$.
Selim Bahadır
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
ABSTRACT Background Reduced bone mineral density (BMD) has been reported in survivors of childhood and young adult acute lymphoblastic leukaemia (ALL); however, data from cohorts treated with contemporary protocols and including matched controls remain limited.
Karen Schow Jensen +10 more
wiley +1 more source
On the Linear Number of Matching Substrings [PDF]
JUCS - Journal of Universal Computer Science Volume Nr.
openaire +1 more source
Number of matching SIFT features.
Number of matching SIFT features.
Jianhua Zhang (6347) +7 more
core +1 more source
ABSTRACT Pediatric intramedullary low‐grade gliomas (PIMLGGs) are rare neoplasms that present unique clinical and management challenges. Although surgery remains the primary tool for tissue diagnosis and decompression, complete gross‐total resection is frequently unfeasible due to the infiltrative nature of these lesions.
Olga M. Sergeenko +5 more
wiley +1 more source
On the Chromatic Number of Matching Kneser Graphs [PDF]
AbstractIn an earlier paper, the present authors (2015) introduced thealtermatic numberof graphs and used Tucker’s lemma, an equivalent combinatorial version of the Borsuk–Ulam theorem, to prove that the altermatic number is a lower bound for chromatic number.
Meysam Alishahi, Hossein Hajiabolhassan
openaire +3 more sources
Identifying Patterns of Hospitalizations Among Childhood Cancer Survivors: A Population‐Based Study
ABSTRACT Background Childhood cancer survivors (CCSs) experience more hospitalizations than the general population. We aimed to identify distinct hospitalization patterns among Queensland CCSs and the associated characteristics. Methods Cases (aged ≤14 years) diagnosed between 1995 and 2019 while residents of Queensland were identified through the ...
Hai Pham +7 more
wiley +1 more source
On the nullity number of graphs
The paper discusses bounds on the nullity number of graphs. It is proved in [B. Cheng and B. Liu, On the nullity of graphs. Electron. J. Linear Algebra 16 (2007) 60--67] that $\eta \le n - D$, where $\eta$, n and D denote the nullity number, the order ...
Mustapha Aouchiche, Pierre Hansen
doaj +1 more source

