Results 41 to 50 of about 390,323 (304)
Two sufficient conditions for fractional k-deleted graphs
Let G be a graph, and k a positive integer. A fractional k-factor is a way of assigning weights to the edges of a graph G (with all weights between 0 and 1) such that for each vertex the sum of the weights of the edges incident with that vertex is k.
Lv Xiangyang
doaj +1 more source
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
A generalization for the clique and independence numbers
In this paper, lower and upper bounds for the clique and independence numbers are established in terms of the eigenvalues of the signless Laplacian matrix of a given graph G.
Maden (Gungor), A. Dilek +1 more
openaire +2 more sources
On subgraph number independence in trees
AbstractFor finite graphs F and G, let NF(G) denote the number of occurrences of F in G, i.e., the number of subgraphs of G which are isomorphic to F. If F and G are families of graphs, it is natural to ask then whether or not the quantities NF(G), F∈F, are linearly independent when G is restricted to G.
Ronald L. Graham, Endre Szemerédi
openaire +1 more source
ABSTRACT Pediatric gastroenteropancreatic neuroendocrine neoplasms (GEP‐NENs) are extremely rare and clinically heterogeneous. Management has largely been extrapolated from adult practice. This European Standard Clinical Practice Guideline (ESCP), developed by the EXPeRT network in collaboration with adult NEN experts, provides (adult) evidence ...
Michaela Kuhlen +23 more
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 Background PIK3CA‐related overgrowth spectrum (PROS) includes several rare overgrowth disorders resulting from somatic gain‐of‐function mutations in PIK3CA. Despite treatment advances, including the recent approval of alpelisib for PROS in the United States, literature detailing the patient experience with PROS is limited.
Vamsi Bollu +8 more
wiley +1 more source
ABSTRACT Background 131I‐metaiodobenzylguanidine (131I‐MIBG) radiotherapy is a key treatment for relapsed and refractory (R/R) neuroblastoma (NB). Patients with R/R disease treated in the modern era are increasingly exposed to anti‐GD2 immunotherapy, which exerts selective pressure and may modify both tumor cell state and microenvironment.
Benjamin J. Lerman +7 more
wiley +1 more source
Independent Transversal Total Domination Versus Total Domination in Trees
A subset of vertices in a graph G is a total dominating set if every vertex in G is adjacent to at least one vertex in this subset. The total domination number of G is the minimum cardinality of any total dominating set in G and is denoted by γt(G).
Martínez Abel Cabrera +2 more
doaj +1 more source

