Results 41 to 50 of about 1,439,443 (264)

Distinguishing Number for some Circulant Graphs [PDF]

, 2014
Introduced by Albertson et al. \cite{albertson}, the distinguishing number $D(G)$ of a graph $G$ is the least integer $r$ such that there is a $r$-labeling of the vertices of $G$ that is not preserved by any nontrivial automorphism of $G$. Most of graphs
Gravier, Sylvain, Meslem, Kahina, Slimani, Souad   +2 more
core  

Real‐World Pediatric Blinatumomab Administration: Access to Outpatient Care Delivery and Impact of a Hospital‐Dispensed Model

Pediatric Blood &Cancer, EarlyView.
ABSTRACT Blinatumomab has been shown to be highly effective for patients with pediatric B‐ALL and has recently become standard of care therapy. Due to its past use in the clinical trial setting, there is limited information available about real‐world administration.
Katelyn Oranges, Kelly A. Duffy, Sara McDonough, Evelyn Kurpiewski, R. Jennifer Randall, Allison Barz Leahy, Haley M. Newman, Joyce P. Lee, Stephen P. Hunger, Anne F. Reilly, David T. Teachey, Susan R. Rheingold, Daniel J. Zheng   +12 more
wiley   +1 more source

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, Yilma Zelealem B.   +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

Characterisations of Classical and Non-classical states of Quantised Radiation

, 1995
A new operator based condition for distinguishing classical from non-classical states of quantised radiation is developed. It exploits the fact that the normal ordering rule of correspondence to go from classical to quantum dynamical variables does not ...
Agarwal G S, Arvind, Arvind, Arvind, , Bhaumik D, Biedenharn L C, Biedenharn L C, Ghosh R, Klauder J R, Mandel L, Mehta C L, Milburn G J, Munroe M, N Mukunda, R Simon, See for instance Born M, Teich M C, Tombesi P, Walls D F, Walls D F, Weyl H   +20 more
core   +1 more source

Clinical Insights Into Hypercalcemia of Malignancy in Childhood

Pediatric Blood &Cancer, EarlyView.
ABSTRACT Hypercalcemia of malignancy (HCM) is a rare but life‐threatening metabolic emergency in children that occurs in less than 1% of pediatric cancer cases, with a reported incidence ranging from 0.4% to 1.0% across different studies. While it is observed in 10%–20% of adult malignancies, pediatric HCM remains relatively uncommon.
Hüseyin Anıl Korkmaz
wiley   +1 more source

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, Imrich Wilfried, Kalinowski Rafał, Pilśniak Monika, Tucker Thomas   +4 more
doaj   +1 more source

Changing, Annulling and Otherwising the Past

Philosophies, 2021
Despite a growing number of models argument for the logical possibility of changing the past there continues to be resistance to and confusion surrounding the possibility of changing the past.
G. C. Goddu
doaj   +1 more source

Automorphisms and Distinguishing Numbers of Geometric Cliques [PDF]

Discrete & Computational Geometry, 2008
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Albertson, Michael O., Boutin, Debra L.
openaire   +2 more sources

List Distinguishing Parameters of Trees [PDF]

, 2011
A coloring of the vertices of a graph G is said to be distinguishing} provided no nontrivial automorphism of G preserves all of the vertex colors. The distinguishing number of G, D(G), is the minimum number of colors in a distinguishing coloring of G ...
Ferrara, Michael, Gethner, Ellen, Hartke, Stephen G., Stolee, Derrick, Wenger, Paul S.   +4 more
core   +1 more source