Results 71 to 80 of about 445,292 (276)
Paint cost and the frugal distinguishing number
You are handed a graph with vertices in a neutral color and asked to color a subset of vertices with expensive paints in $d$ colors in such a way that only the trivial symmetry preserves the color classes. Your goal is to minimize the number of vertices needing this expensive paint. This paper address the issues surrounding your choices. In particular,
openaire +2 more sources
ABSTRACT Background General pediatricians often evaluate hematologic and oncologic presentations before subspecialty consultation, yet the 2025 Accreditation Council for Graduate Medical Education (ACGME) pediatric requirements reduce inpatient pediatric hematology/oncology (PHO) time, raising questions about resident readiness.
Colburn Yu, Rohini Jain
wiley +1 more source
Distinguishing number and adjacency properties [PDF]
Dedicated to the memory of Roland Fräıssé. Abstract. The distinguishing number of countably infinite graphs and relational struc-tures satisfying a simple adjacency property is shown to be 2. This result generalizes both a result of Imrich et al.
Dejan Delić, Anthony Bonato
core
A classification model for distinguishing copy number variants from cancer-related alterations
Background Both somatic copy number alterations (CNAs) and germline copy number variants (CNVs) that are prevalent in healthy individuals can appear as recurrent changes in comparative genomic hybridization (CGH) analyses of tumors.
Olshen Adam B +2 more
doaj +1 more source
ABSTRACT As part of the European Cooperative Study Group for Paediatric Rare Tumours initiative, we developed standard clinical practice guidelines for ovarian sex cord stromal tumors, based on comprehensive national and international cohort analyses, literature review, and a final expert consensus conference.
Dominik T. Schneider +15 more
wiley +1 more source
The maximum distinguishing number of a group [PDF]
Let G be a group acting faithfully on a set X. The distinguishing number of the action of G on X, denoted DG(X), is the smallest number of colors such that there exists a coloring of X where no nontrivial group element induces a colorpreserving ...
Melody Chan
core
The number of distinguishing colorings of a Cartesian product graph [PDF]
A vertex coloring is called distinguishing if the identity is the only automorphism that can preserve it. The distinguishing threshold $\theta(G)$ of a graph $G$ is the minimum number of colors $k$ required that any arbitrary $k$-coloring of $G$ is ...
Shekarriz, Mohammad Hadi +1 more
core +2 more sources
ABSTRACT Background Pediatric cancer remains a leading cause of morbidity and mortality worldwide, particularly in low‐and middle‐income countries. Cancer treatment may impair nutritional status, alter body composition, and exacerbate cancer‐related fatigue (CRF).
Luís Carlos Lopes‐Junior +11 more
wiley +1 more source
Vertex-Distinguishing IE-Total Colorings of Complete Bipartite Graphs Km,N(m < n)
Let G be a simple graph. An IE-total coloring f of G is a coloring of the vertices and edges of G so that no two adjacent vertices receive the same color. Let C(u) be the set of colors of vertex u and edges incident to u under f. For an IE-total coloring
Chen Xiang’en, Gao Yuping, Yao Bing
doaj +1 more source
ABSTRACT Background Together, leukemia and lymphoma account for 38.7% of newly diagnosed pediatric cancer cases in the United States each year. Many caregivers utilize online resources to inform medical health decisions. Understanding the readability of these materials is critical to ensuring comprehensible patient education.
Chloe Strege +6 more
wiley +1 more source

