Results 71 to 80 of about 270,997 (279)
Persistence and stability properties of powers of ideals [PDF]
, 2012 We introduce the concept of strong persistence and show that it implies persistence regarding the associated prime ideals of the powers of an ideal. We also show that strong persistence is equivalent to a condition on power of ideals studied by Ratliff ...
Herzog, Jürgen, Qureshi, Ayesha Asloob
core
Regularity of Edge Ideals and Their Powers
, 2018 We survey recent studies on the Castelnuovo-Mumford regularity of edge ideals of graphs and their powers. Our focus is on bounds and exact values of $\text{ reg } I(G)$ and the asymptotic linear function $\text{ reg } I(G)^q$, for $q \geq 1,$ in terms of
A Alilooee +39 more
core +1 more source
Molecular cancer prevention: Intercepting disease
Molecular Oncology, EarlyView.Oncological practice must evolve, from treating established tumours to proactive cancer interception before clinical manifestation. This will require mechanistic insight into tumour initiation, validated biomarkers of early disease development and redesigned clinical trials, enabling cancer interception to become a core pillar of oncology with the ...
Charlotte Grieco +2 more
wiley +1 more source
The Behavior of Tree-Width and Path-Width Under Graph Operations and Graph Transformations
AlgorithmsTree-width and path-width are well-known graph parameters. Many NP-hard graph problems admit polynomial-time solutions when restricted to graphs of bounded tree-width or bounded path-width. In this work, we study the behavior of tree-width and path-width
Frank Gurski, Robin Weishaupt
doaj +1 more source
Molecular Oncology, EarlyView.Dormant cancer cells can hide in distant organs for years, evading treatment and the immune system. This review highlights how signals from the surrounding tissue and immune environment keep these cells inactive or trigger their reawakening. Understanding these mechanisms may help develop therapies to eliminate or control dormant cells and prevent ...
Kanishka Tiwary +1 more
wiley +1 more source
Mathematica Bohemica, 1997 The concept of magic graph was introduced by J. Sedláček. A valuation of the edges of a graph by pairwise different positive numbers is called magic, if the sum of values of edges incident with a given vertex is the same for all vertices. If there exists a magic valuation of a graph \(G\), then \(G\) is called a magic graph.
Trenkler, M., Vetchý, V.
openaire +1 more source
Molecular Oncology, EarlyView.Radiotherapy (RT) response depends on the DNA repair capacity of tumor and host cells. We show that circulating tumor cell (CTC) counts and apoptosis rates before and after RT predict treatment response and outcome, which can be accessed via easily accessible liquid biopsy approaches. Created in BioRender. Wikman, H.
Yvonne Goy +10 more
wiley +1 more source
Approximation Algorithms for Multicoloring Planar Graphs and Powers of Square and Triangular Meshes
Discrete Mathematics & Theoretical Computer Science, 2006 A multicoloring of a weighted graph G is an assignment of sets of colors to the vertices of G so that two adjacent vertices receive two disjoint sets of colors. A multicoloring problem on G is to find a multicoloring of G.
Mustapha Kchikech, Olivier Togni
doaj
Some New Properties for Degree-Based Graph Entropies
Entropy, 2015 The graph entropies inspired by Shannon’s entropy concept become the information-theoretic quantities for measuring the structural information of graphs and complex networks.
Guoxiang Lu, Bingqing Li, Lijia Wang
doaj +1 more source
The adjacency matrix of one type of graph and the Fibonacci numbers [PDF]
, 2012 Recently there is huge interest in graph theory and intensive study on computing integer powers of matrices. In this paper, we investigate relationships between one type of graph and well-known Fibonacci sequence.
Bozkurt, Durmuş +2 more
core