Results 41 to 50 of about 9,407,399 (300)
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
A lower bound on the independence number of a graph in terms of degrees [PDF]
For a connected and non-complete graph, a new lower bound on its independence number is proved.
Harant, Jochen, Schiermeyer, Ingo
core +2 more sources
Ewing Sarcoma in Infants and Children Under 2 Years of Age: A French Retrospective Study
ABSTRACT Ewing sarcoma, the second most common primary bone cancer in children, requires intensive treatment that may lead to significant long‐term sequelae, particularly in infants. We retrospectively analyzed data from 1621 French patients treated between 1988 and 2015 within the EW88/93/97 or EE99 trials, focusing on 17 infants diagnosed before 24 ...
Elodie Verdier +18 more
wiley +1 more source
On subgraph number independence in trees
AbstractFor finite graphs F and G, let NF(G) denote the number of occurrences of F in G, i.e., the number of subgraphs of G which are isomorphic to F. If F and G are families of graphs, it is natural to ask then whether or not the quantities NF(G), F∈F, are linearly independent when G is restricted to G.
Ronald L. Graham, Endre Szemerédi
openaire +1 more source
Clique immersions and independence number
13 pages, 1 figure.
Sebastián Bustamante 0001 +3 more
openaire +3 more sources
ABSTRACT Background The Standards for Psychosocial Care for Children with Cancer and Their Families (“Standards”) are evidence‐based guidelines for psychosocial care in pediatric oncology. Care related to the three “Asking and Monitoring” Standards—Assessment of Psychosocial Needs, Assessment of Financial Needs, and Monitoring Neurocognitive Problems ...
Julia B. Tager +8 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
Global Efforts to Reduce Paediatric Cancer Care Disparities in Radiotherapy: A Decade Change
ABSTRACT Background We present an update on the status, needs and challenges faced by paediatric imaging and radiotherapy (RT) programmes globally after a previous survey conducted by the International Atomic Energy Agency (IAEA) 10 years prior. Methods We developed and distributed a 121‐question survey to radiation oncologists, medical physicists and ...
Raymond B. Mailhot Vega +10 more
wiley +1 more source
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 Shwachman–Diamond syndrome (SDS) is a rare autosomal recessive ribosomopathy characterized by bone marrow failure and multisystem involvement, with emerging evidence of associated neurocognitive impairment. Methods We conducted a retrospective study of 240 individuals with biallelic Shwachman–Bodian–Diamond syndrome (SBDS) mutations
Jane Koo +11 more
wiley +1 more source

