Results 81 to 90 of about 983,866 (300)
Independent sets and independent dominating sets in the strong product of paths and cycles [PDF]
, 2005 In this paper we will consider independent sets and independent dominating sets in the strong product of two paths,two cycles and a path and a ...
Klobučar, A., Antoaneta Klobučar
core
On the number of maximal independent sets in a graph [PDF]
Discrete Mathematics & Theoretical Computer Science, 2011 Combinatorics
David R. Wood
doaj +1 more source
Stable sets versus independent sets
Discrete Mathematics, 1993 The matroidal number \(m(G)\) of a graph \(G\) is defined as the smallest integer \(m\) so that the collection of the stable sets of \(G\) arises as \(I_ 1\cup I_ 2 \cup \cdots \cup I_ m\) where the \(I_ i\) are collections of independent sets of matroids on the vertex set of \(G\).
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
On perfect and unique maximum independent sets in graphs [PDF]
, 2004 summary:A perfect independent set $I$ of a graph $G$ is defined to be an independent set with the property that any vertex not in $I$ has at least two neighbors in $I$.
Volkmann, Lutz
core +1 more source
Random independent sets in triangle-free graphs
Forum of Mathematics, SigmaWe establish several new results on the existence of probability distributions on the independent sets in triangle-free graphs where each vertex is present with a given probability.
Anders Martinsson, Raphael Steiner
doaj +1 more source
Subclass mapping: identifying common subtypes in independent disease data sets. [PDF]
PLoS ONE, 2007 Whole genome expression profiles are widely used to discover molecular subtypes of diseases. A remaining challenge is to identify the correspondence or commonality of subtypes found in multiple, independent data sets generated on various platforms. While
Yujin Hoshida +4 more
doaj +1 more source
A Generalization of maximal independent sets
Discrete Applied Mathematics, 2001 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Arun K. Jagota +2 more
openaire +1 more source
Pediatric Blood &Cancer, EarlyView.ABSTRACT Objectives The association between exposure to dinutuximab beta (DB) and event‐free survival (EFS) or overall survival (OS) of neuroblastoma patients was assessed using data collected during three clinical trials (five cohorts). Methods A systematic review (March 2026) was conducted to identify relevant studies (prospective; registered DB ...
Przemysław Holko +19 more
wiley +1 more source
The Well-Covered Dimension Of Products Of Graphs
Discussiones Mathematicae Graph Theory, 2014 We discuss how to find the well-covered dimension of a graph that is the Cartesian product of paths, cycles, complete graphs, and other simple graphs. Also, a bound for the well-covered dimension of Kn × G is found, provided that G has a largest greedy ...
Birnbaum Isaac +4 more
doaj +1 more source