Results 141 to 150 of about 390,323 (304)

Independence Number in Path Graphs.

Comput. Artif. Intell., 2004
In the paper we present results, which allow us to compute the independence numbers of $P_2$-path graphs and $P_3$-path graphs of special graphs. As $P_2(G)$ and $P_3(G)$ are subgraphs of iterated line graphs $L^2(G)$ and $L^3(G)$, respectively, we compare our results with the independence numbers of corresponding iterated line graphs.
Knor, Martin, Niepel, Ľudovít
openaire   +1 more source

Tumour–host interactions in Drosophila: mechanisms in the tumour micro‐ and macroenvironment

Molecular Oncology, EarlyView.
This review examines how tumour–host crosstalk takes place at multiple levels of biological organisation, from local cell competition and immune crosstalk to organism‐wide metabolic and physiological collapse. Here, we integrate findings from Drosophila melanogaster studies that reveal conserved mechanisms through which tumours hijack host systems to ...
José Teles‐Reis, Tor Erik Rusten
wiley   +1 more source

Circular RNA expression landscapes in myelodysplastic neoplasms: Associations with mutational signatures and disease progression

Molecular Oncology, EarlyView.
In this explorative study, the abundance of circular RNA molecules in bone marrow stem cells was found to be elevated in patients with high‐risk myelodysplastic neoplasms, and to be associated with an increased risk of progression to acute myeloid leukemia.
Eileen Wedge, Morten Tulstrup, Gabriele Todisco, Pedro Moura, Christophe Côme, Jakob Werner Hansen, Jakob Schmidt Jespersen, Balthasar Schlotmann, Maria Creignou, Mette Dahl, Claudia Schöllkopf, Klas Raaschou‐Jensen, Krister Wennerberg, Bo Porse, Joachim Weischenfeldt, Eva Hellström‐Lindberg, Lasse Sommer Kristensen, Kirsten Grønbæk   +17 more
wiley   +1 more source

Spectral bounds for the k-independence number of a graph

, 2015
In this paper, we obtain two spectral upper bounds for the k-independence number of a graph which is the maximum size of a set of vertices at pairwise distance greater than k. We construct graphs that attain equality for our first bound and show that our
Tait, Michael, Aida Abiad, Cioabă, Sebastian M., Abiad Monge, Aida, Michael Tait, Abiad, Aida, Cioaba, Sebastian, Sebastian M. Cioabă   +7 more
core   +1 more source

On k-prime graphs

Open Mathematics
In the context of a simple undirected graph GG, a kk-prime labeling refers to assigning distinct integers from the set {k,k+1,…,∣V(G)∣+k−1}\left\{k,k+1,\ldots ,| V\left(G)| +k-1\right\} to its vertices, such that adjacent vertices in GG are labeled with ...
Abughneim Omar A., Abughazaleh Baha’
doaj   +1 more source

Subtype‐specific enhancer RNAs define transcriptional regulators and prognosis in breast cancers

Molecular Oncology, EarlyView.
This study employed machine learning methodologies to perform the subtype‐specific classification of RNA‐seq data sets, which are mapped on enhancers from TCGA‐derived breast cancer patients. Their integration with gene expression (referred to as ProxCReAM eRNAs) and chromatin accessibility profiles has the potential to identify lineage‐specific and ...
Aamena Y. Patel, Peyman Zarrineh, Nathnael T. Tuffa, Jigar H. Sheth, Sumitra Mohan, Mudassar Iqbal, Sankari Nagarajan   +6 more
wiley   +1 more source

“Women, film and independence in the 21st century: A public forum.”

, 2018
What are the issues and factors that impact on the shape of women’s independent filmmaking today? What does “independence” mean both in and for women’s screen production today?
Davis, Therese, Brooks, Jodi ; https://orcid.org/, Perkins, Claire   +2 more
core  

General multiplicative Zagreb indices of trees with given independence number

, 2021
We obtain lower and upper bounds on general multiplicative Zagreb indices for trees with given independence number and order. Bounds on basic multiplicative Zagreb indices follow from our results. We also show that the bounds are best possible.Key words:
Balachandran, Selvaraj, Vetrik, Tomas
core  

The minimum number of maximal independent sets in graphs with given order and independence number

Discrete Applied Mathematics
Let $MIS(G)$ be the set of all maximal independent sets in a graph $G$, and let $mis(G)=|MIS(G)|$. In this paper, we show that for any tree $T$ with $n$ vertices and independence number $α$, \[mis(T)\geq f(n-α),\] and for any unicyclic graph $G$ with $n$ vertices and independence number $α$, \begin{align*} mis(G)\geq \begin{cases} 2, & \text ...
Yuting Tian, Jianhua Tu
openaire   +3 more sources

Dimethyl fumarate combined with cisplatin at subcytotoxic doses sensitizes cervical cancer toward ferroptosis and apoptosis through GSH restriction and p53 (re)activation

Molecular Oncology, EarlyView.
Dimethyl fumarate (DMF) reduces growth of HPV‐positive cervical cancer spheroids and induces ferroptosis in cervical cancer cells via blocking SLC7A11/Glutathione (GSH) axis. Combination of subcytotoxic doses of DMF and cisplatin (CDDP) further suppresses spheroid growth and drives cell death in 2D culture models.
Carolina Punziano, Giuseppina Minopoli, Simona Romano, Laura Marrone, Katia Aquilano, Maria Lina Tornesello, Raffaella Faraonio   +6 more
wiley   +1 more source