Results 51 to 60 of about 445,292 (276)
A Tight Bound on the Set Chromatic Number
Discussiones Mathematicae Graph Theory, 2013 We provide a tight bound on the set chromatic number of a graph in terms of its chromatic number. Namely, for all graphs G, we show that χs(G) > ⌈log2 χ(G)⌉ + 1, where χs(G) and χ(G) are the set chromatic number and the chromatic number of G ...
Sereni Jean-Sébastien +1 more
doaj +1 more source
Neighbor Sum Distinguishing Total Chromatic Number of Planar Graphs without 5-Cycles
Discussiones Mathematicae Graph Theory, 2020 For a given graph G = (V (G), E(G)), a proper total coloring ϕ: V (G) ∪ E(G) → {1, 2, . . . , k} is neighbor sum distinguishing if f(u) ≠ f(v) for each edge uv ∈ E(G), where f(v) = Σuv∈E(G) ϕ(uv)+ϕ(v), v ∈ V (G). The smallest integer k in such a coloring
Zhao Xue, Xu Chang-Qing
doaj +1 more source
Pediatric Blood &Cancer, EarlyView.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
The distinguishing chromatic number [PDF]
, 2008 . In this paper we define and study the distinguishing chromatic number, χD(G), of a graph G, building on the work of Albertson and Collins who studied the distinguishing number.
Karen L. Collins, Ann, N. Trenk
core
Distinguishing Cartesian Products of Countable Graphs
Discussiones Mathematicae Graph Theory, 2017 The distinguishing number D(G) of a graph G is the minimum number of colors needed to color the vertices of G such that the coloring is preserved only by the trivial automorphism.
Estaji Ehsan +4 more
doaj +1 more source
On the local distinguishing numbers of cycles
Discrete Mathematics, 1999 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
C. T. Cheng, Lenore Cowen
openaire +2 more sources
The Distinguishing Chromatic Number of Kneser Graphs [PDF]
The Electronic Journal of Combinatorics, 2013 A labeling $f: V(G) \rightarrow \{1, 2, \ldots, d\}$ of the vertex set of a graph $G$ is said to be proper $d$-distinguishing if it is a proper coloring of $G$ and any nontrivial automorphism of $G$ maps at least one vertex to a vertex with a different label.
Zhongyuan Che, Karen L. Collins
openaire +2 more sources
Re‐Irradiation in Pediatric Diffuse Midline Glioma: A Multi‐Institutional Retrospective Study
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background Children with recurrent diffuse midline gliomas (DMGs) have limited therapeutic options at recurrence. Re‐irradiation (RT2) may be used at progression, but with uncertainty about the benefit. Methods We conducted a multi‐institutional retrospective study of children aged < 18 with DMG treated at three centers (Toronto, Canada ...
Ajay Thomas Alex +13 more
wiley +1 more source
The distinguishing number of Cartesian products of complete graphs [PDF]
, 2008 The distinguishing number D(G) of a graph G is the least integer d such that G has a labeling with d labels that is preserved only by a trivial automorphism.
Imrich, Wilfried +2 more
core +3 more sources
The distinguishing number of groups based on the distinguishing number of subgroups
, 2016 11 ...
Alikhani, Saeid, Soltani, Samaneh
openaire +2 more sources