Results 51 to 60 of about 1,439,443 (264)

Gauge symmetry and W-algebra in higher derivative systems

open access: yes, 2011
The problem of gauge symmetry in higher derivative Lagrangian systems is discussed from a Hamiltonian point of view. The number of independent gauge parameters is shown to be in general {\it{less}} than the number of independent primary first class ...
A Hanson   +55 more
core   +1 more source

Survival Outcomes and Complications Among Canadian Children With Retinoblastoma: A Population‐Based Report From CYP‐C

open access: yesPediatric Blood &Cancer, EarlyView.
ABSTRACT Purpose Retinoblastoma (RB) is the most common pediatric ocular cancer, yet population‐based data on survival and risk factors remain limited. This study aimed to describe survival in a large national RB cohort and identify predictors of death and complications.
Samuel Sassine   +14 more
wiley   +1 more source

The chromatic distinguishing index of certain graphs

open access: yesAKCE International Journal of Graphs and Combinatorics, 2020
The distinguishing index of a graph , denoted by , is the least number of labels in an edge coloring of not preserved by any non-trivial automorphism. The distinguishing chromatic index of a graph is the least number such that has a proper edge coloring ...
Saeid Alikhani, Samaneh Soltani
doaj   +1 more source

Sirolimus for Extracranial Arteriovenous Malformations: A Scoping Review of the Evidence in Syndromic and Non‐Syndromic Cases

open access: yesPediatric Blood &Cancer, EarlyView.
ABSTRACT Arteriovenous malformations (AVMs) are rare, high‐flow, vascular anomalies that can occur either sporadically or as part of a genetic syndrome. AVMs can progress with serious morbidity and even mortality if left unchecked. Sirolimus is an mTOR inhibitor that is effective in low‐flow vascular malformations; however, its role in AVMs is unclear.
Will Swansson   +3 more
wiley   +1 more source

A Note on the Total Detection Numbers of Cycles

open access: yesDiscussiones Mathematicae Graph Theory, 2015
Let G be a connected graph of size at least 2 and c :E(G)→{0, 1, . . . , k− 1} an edge coloring (or labeling) of G using k labels, where adjacent edges may be assigned the same label. For each vertex v of G, the color code of v with respect to c is the k-
Escuadro Henry E.   +2 more
doaj   +1 more source

Smarandachely Adjacent Vertex Distinguishing Edge Coloring Algorithm of Graphs [PDF]

open access: yesJisuanji gongcheng, 2017
To solve the problem of Smarandachely Adjacent Vertex Distinguishing Edge Coloring(SAVDEC) of graphs,this paper presents a coloring algorithm based on multi-objective optimization.For each sub problem,the sub objective function vector and decision space ...
CAO Daotong,LI Jingwen,WEN Fei
doaj   +1 more source

THE DISTINGUISHING NUMBERS OF MERGED JOHNSON GRAPHS [PDF]

open access: yesBulletin of the Korean Mathematical Society, 2015
In present article, we determine the distinguishing number of the merged Johnson graphs which are generalization of both the Kneser graphs and of the Johnson graphs.
Kim, Dongseok   +2 more
openaire   +2 more sources

Evaluating the Utility of Paired Tumor and Germline Targeted DNA Sequencing for Pediatric Oncology Patients: A Single Institution Report

open access: yesPediatric Blood &Cancer, EarlyView.
ABSTRACT Objective To evaluate the diagnostic yield and utility of universal paired tumor–normal multigene panel sequencing in newly diagnosed pediatric solid and central nervous system (CNS) tumor patients and to compare the detection of germline pathogenic/likely pathogenic variants (PV/LPVs) against established clinical referral criteria for cancer ...
Natalie Waligorski   +9 more
wiley   +1 more source

Distinguishing between lepton number violating scalars at the LHC

open access: yesEPJ Web of Conferences, 2013
Scalars with lepton number violating interactions decaying into lepton pairs, as those mediating the see-saw of type II, always include doubly-charged components.
Santamaria Arcadi   +3 more
doaj   +1 more source

Game distinguishing numbers of Cartesian products

open access: yesArs Mathematica Contemporanea, 2017
Summary: The distinguishing number of a graph \(H\) is a symmetry related graph invariant whose study started two decades ago. The distinguishing number \(D\)(\(H\)) is the least integer \(d\) such that \(H\) has a distinguishing \(d\)-coloring. A distinguishing \(d\)-coloring is a coloring \(c\): \(V(H) \to \{1,\ldots, d\}\) invariant only under the ...
Gravier, Sylvain   +3 more
openaire   +4 more sources

Home - About - Disclaimer - Privacy