Results 61 to 70 of about 1,974,122 (287)
Complexes of graphs with bounded independence number [PDF]
, 2022 Minki Kim, Alan Lew
openalex +1 more source
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background Cyclophosphamide (CY) is associated with potentially fatal cardiotoxicity, yet no electrocardiographic indices have been established for early detection of CY‐induced cardiomyopathy. This study aimed to determine whether corrected QT interval (QTc) prolongation can predict early onset of CY‐related cardiac dysfunction in pediatric ...
Junpei Kawamura +5 more
wiley +1 more source
Recent developments on the power graph of finite groups – a survey
AKCE International Journal of Graphs and Combinatorics, 2021 Algebraic graph theory is the study of the interplay between algebraic structures (both abstract as well as linear structures) and graph theory. Many concepts of abstract algebra have facilitated through the construction of graphs which are used as tools
Ajay Kumar +3 more
doaj +1 more source
Algebraic independence of the partial derivatives of certain functions with arbitrary number of variables [PDF]
, 2022 Haruki Ide, Taka-aki Tanaka
openalex +1 more source
Pediatric Blood &Cancer, EarlyView.ABSTRACT Objectives To identify predictors of chronic ITP (cITP) and to develop a model based on several machine learning (ML) methods to estimate the individual risk of chronicity at the timepoint of diagnosis. Methods We analyzed a longitudinal cohort of 944 children enrolled in the Intercontinental Cooperative immune thrombocytopenia (ITP) Study ...
Severin Kasser +6 more
wiley +1 more source
Some results on the independence number of connected domination critical graphs
AKCE International Journal of Graphs and Combinatorics, 2018 A --critical graph is a graph with connected domination number and for any pair of non-adjacent vertices and of . Let and be respectively the clique number and the independence number of a graph.
P. Kaemawichanurat, T. Jiarasuksakun
doaj +1 more source
Relating broadcast independence and independence
, 2018 An independent broadcast on a connected graph $G$ is a function $f:V(G)\to \mathbb{N}_0$ such that, for every vertex $x$ of $G$, the value $f(x)$ is at most the eccentricity of $x$ in $G$, and $f(x)>0$ implies that $f(y)=0$ for every vertex $y$ of $G ...
Bessy, Stéphane, Rautenbach, Dieter
core +1 more source
Pediatric Blood &Cancer, EarlyView.ABSTRACT Surveillance imaging aims to detect tumour relapse before symptoms develop, but it's unclear whether earlier detection of relapse leads to better outcomes in children and young people (CYP) with medulloblastoma and ependymoma. This systematic review aims to identify relevant literature to determine the efficacy of surveillance magnetic ...
Lucy Shepherd +3 more
wiley +1 more source
On The Independence Number Of Some Strong Products Of Cycle-Powers
Foundations of Computing and Decision Sciences, 2015 In the paper we give some theoretical and computational results on the third strong power of cycle-powers, for example, we have found the independence numbers α((C102)√3) = 30 and α((C144)√3) = 14.
Jurkiewicz Marcin +2 more
doaj +1 more source
Hadwiger's conjecture for graphs with forbidden holes
, 2017 Given a graph $G$, the Hadwiger number of $G$, denoted by $h(G)$, is the largest integer $k$ such that $G$ contains the complete graph $K_k$ as a minor. A hole in $G$ is an induced cycle of length at least four.
Song, Zi-Xia, Thomas, Brian
core +1 more source