Results 41 to 50 of about 1,999,234 (282)
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Poureidi Abolfazl, Rad Nader Jafari
openaire +2 more sources
On the Independence Number of Traceable 2-Connected Claw-Free Graphs
A well-known theorem by Chvátal-Erdőos [A note on Hamilton circuits, Discrete Math. 2 (1972) 111–135] states that if the independence number of a graph G is at most its connectivity plus one, then G is traceable.
Wang Shipeng, Xiong Liming
doaj +1 more source
Independence number in graphs and its upper bounds [PDF]
In this paper, we use the double counting method to find some upper bounds for the independence number of a simple graph in terms of its order, size and maximum degree. Moreover, we determine extremal graphs attaining equality in upper bounds.
Farzad Shaveisi
doaj +1 more source
The critical independence number and an independence decomposition
10 pages, 4 ...
openaire +3 more sources
Clinical Insights Into Hypercalcemia of Malignancy in Childhood
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
A note on subspace sum graph of vector spaces
For a finite dimensional vector space over a field the subspace sum graph of denoted by is defined to be a simple undirected graph with vertex set as the set of all non-trivial proper subspace of and, for any two distinct vertices V1 and V2 are adjacent ...
Ramanathan Venkatasalam +1 more
doaj +1 more source
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
Ideal Independence, Free Sequences, and the Ultrafilter Number [PDF]
We make use of a forcing technique for extending Boolean algebras. The same type of forcing was employed in [BK81], [Kos99], and elsewhere. Using and modifying a lemma of Koszmider, and using CH, we obtain an atomless BA, A such that f(A) = smm(A) < u(A),
Selker, Kevin
core
On the $k$-independence number of graphs
© 2019. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/
Abiad, Aida +2 more
openaire +4 more sources
Clique immersions and independence number
13 pages, 1 figure.
Bustamante, Sebastián +3 more
openaire +3 more sources

