Results 71 to 80 of about 305,530 (267)

End Behavior of the Threshold Protocol Game on Complete and Bipartite Graphs

Games
The threshold protocol game is a graphical game that models the adoption of an idea or product through a population. There are two states players may take in the game, and the goal of the game is to motivate the state that begins in the minority to ...
Alexandra Fedrigo
doaj   +1 more source

Computing a maximal clique of graphs of cofinite submonoids [PDF]

Notes on Number Theory and Discrete Mathematics
A graph G𝔰 is called an 𝔰(τ,e)-graph if there exists a numerical semigroup 𝔰 with multiplicity τ and embedding dimension e such that V(G𝔰)={v_α : α ∈ℕ₀\𝔰} and E(G𝔰)={v_αv_β⇔α+β∈𝔰}.
Anam Shahzadi, Muhammad Ahsan Binyamin
doaj   +1 more source

Differential expression of cancer‐related genes supports prediction of poor response to first‐line treatments in T‐ALL pediatric patients with high minimal residual disease

Molecular Oncology, EarlyView.
In the present work, we have identified a transcriptional signature based on the differential expression of six genes (BCL2&MAST4, HSH2D&LAT2, METRN&PITPNM2) that would facilitate the early detection of T‐cell acute lymphoblastic leukemia (T‐ALL) patients prone to a poor treatment response and could be implemented at diagnosis, along with other risk ...
Antonio Lahera, Laura Vela‐Martín, Pablo Fernández‐Navarro, José Luis López‐Lorenzo, Javier Cornago, Pilar Llamas, Eduardo Pérez‐Gómez, José Luis Marín‐Rubio, Manuel Fresno, Javier Santos, José Fernández‐Piqueras, María Villa‐Morales   +11 more
wiley   +1 more source

CCDC80 suppresses high‐grade serous ovarian cancer migration via negative regulation of B7‐H3

Molecular Oncology, EarlyView.
PAX8 is a lineage‐specific master regulator of transcription in high‐grade serous ovarian cancer (HGSC) progression. We show for the first time that PAX8 facilitates proliferation and metastasis by repressing the cell autonomous tumor suppressor CCDC80 and inducing B7‐H3 expression.
Aya Saleh, Nitzan Medina‐Itzhaki, Milena Chekov, Eden Gal‐Swisa, Roba Gabesh‐Wahabi, Inbar Savyon, Inna Naroditsky, Hilary A. Kenny, Basem Fares, Lina Korsensky, Einav Girsh, Liron Berger, Ruth Perets   +12 more
wiley   +1 more source

Signed Complete Graphs with Maximum Index

Discussiones Mathematicae Graph Theory, 2020
Let Γ = (G, σ) be a signed graph, where G is the underlying simple graph and σ E(G) → {−, +} is the sign function on the edges of G. The adjacency matrix of a signed graph has −1 or +1 for adjacent vertices, depending on the sign of the edges.
Akbari Saieed, Dalvandi Soudabeh, Heydari Farideh, Maghasedi Mohammad   +3 more
doaj   +1 more source

KDM7A and KDM1A inhibition suppresses tumour promoting pathways in prostate cancer

Molecular Oncology, EarlyView.
Treatment resistance is a major challenge for patients with advanced prostate cancer. This study examined an alternative approach to target the major prostate cancer‐promoting pathway by targeting epigenetic factors, whose levels are higher in tumours.
Jennie N Jeyapalan, Veronika M Metzler, Simone de Brot, Corinne L Woodcock, Anna E Harris, Jennifer Lothion‐Roy, Emeli M Nilsson, Atara Ntekim, Michael S Toss, Jenny L Persson, Francesca Khani, Brian D Robinson, Lorraine J Gudas, Emad Rakha, David M Heery, Catrin S Rutland, Nigel P Mongan   +16 more
wiley   +1 more source

Longitudinal circulating tumor DNA profiling in patients with advanced endometrial cancer using an off‐the‐shelf targeted NGS panel

Molecular Oncology, EarlyView.
Intratumour heterogeneity complicates precision management of advanced endometrial cancer. Circulating tumor DNA (ctDNA) offers a minimally invasive strategy to capture tumor evolution and therapeutic resistance. Here, we compare tumor‐agnostic NGS with tumor‐informed ddPCR, outlining their relative sensitivity, concordance, and clinical implications ...
Carlos Casas‐Arozamena, Karin Teien Lande, Eva Diaz, Ana Vilar, Juan Cueva, Efigenia Arias, Victoria Sampayo, Alicia Abalo, Nerea González, Eva Colás, Antonio Gil‐Moreno, Miguel Abal, Gema Moreno‐Bueno, Therese Sørlie, Kristina Lindemann, Laura Muinelo‐Romay   +15 more
wiley   +1 more source

Isolated Single Valued Neutrosophic Graphs [PDF]

Neutrosophic Sets and Systems, 2016
Many results have been obtained on isolated graphs and complete graphs. In this paper, a necessary and sufficient condition will be proved for a single valued neutrosophic graph to be an isolated single valued neutrosophic graph.
Said Broumi, Assia Bakali, Mohamed Talea, Florentin Smarandache   +3 more
doaj  

Decompositions of Complete Multipartite Graphs into Complete Graphs

, 2011
Let $k\geq\ell\geq1$ and $n\geq 1$ be integers. Let $G(k,n)$ be the complete $k$-partite graph with $n$ vertices in each colour class. An $\ell$-decomposition of $G(k,n)$ is a set $X$ of copies of $K_k$ in $G(k,n)$ such that each copy of $K_\ell$ in $G(k,n)$ is a subgraph of exactly one copy of $K_k$ in $X$. This paper asks: when does $G(k,n)$ have an $
Fabila-Monroy, Ruy, Wood, David R.
openaire   +2 more sources

Partitioning graphs into complete and empty graphs

Discrete Mathematics, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Tínaz Ekim, John Gimbel
openaire   +1 more source