Results 61 to 70 of about 52,296 (256)

Edge-Dual Graph Preserving Sign Prediction for Signed Social Networks

open access: yesIEEE Access, 2017
Though existing works of sign prediction have reasonable prediction performances, they suffer from the data sparseness problem, especially for the negative link prediction.
Weiwei Yuan   +3 more
doaj   +1 more source

SUM SIGNED GRAPHS – II

open access: yesUral Mathematical Journal, 2020
In this paper, the study of sum signed graphs is continued. The balancing and switching nature of the graphs are analyzed. The concept of  \(rna\) number is revisited and an important relation between the number and its complement is established.
Athira P. Ranjith   +1 more
openaire   +4 more sources

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

open access: yesMolecular 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   +15 more
wiley   +1 more source

Signed star (k,k)-domatic number of a graph [PDF]

open access: yesOpuscula Mathematica, 2014
Let \(G\) be a simple graph without isolated vertices with vertex set \(V(G)\) and edge set \(E(G)\) and let \(k\) be a positive integer. A function \(f:E(G)\longrightarrow \{-1, 1\}\) is said to be a signed star \(k\)-dominating function on \(G\) if ...
S. M. Sheikholeslami, L. Volkmann
doaj   +1 more source

On the Powers of Signed Graphs

open access: yes, 2020
A signed graph is an ordered pair $Σ=(G,σ),$ where $G=(V,E)$ is the underlying graph of $Σ$ with a signature function $σ:E\rightarrow \{1,-1\}$. In this article, we define $n^{th}$ power of a signed graph and discuss some properties of these powers of signed graphs.
T V, Shijin, K A, Germina, K, Shahul
openaire   +2 more sources

Metastasis on pause: How dormant tumor cells stay hidden within the tumor microenvironment and evade immune surveillance

open access: yesMolecular 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

On equienergetic signed graphs

open access: yesDiscrete Applied Mathematics, 2015
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mushtaq A. Bhat, Shariefuddin Pirzada
openaire   +2 more sources

The Chromatic Number of a Signed Graph [PDF]

open access: yesThe Electronic Journal of Combinatorics, 2016
In 1982, Zaslavsky introduced the concept of a proper vertex colouring of a signed graph $G$ as a mapping $\phi\colon V(G)\to \mathbb{Z}$ such that for any two adjacent vertices $u$ and $v$ the colour $\phi(u)$ is different from the colour $\sigma(uv)\phi(v)$, where is $\sigma(uv)$ is the sign of the edge $uv$.
Edita Mácajová   +2 more
openaire   +3 more sources

Developmental programmes drive cellular plasticity, disease progression and therapy resistance in lung adenocarcinoma

open access: yesMolecular Oncology, EarlyView.
This study shows that lung adenocarcinomas exploit developmental branching morphogenesis to acquire a therapy resistant basal‐like tumour cell state. This process was found to be regulated by combined TP53 loss‐of‐function and type‐I interferon signalling, identifying a novel axis for biomarker and therapeutic target discovery.
Kamila J Bienkowska   +13 more
wiley   +1 more source

Laplacian Spectral Properties of Signed Circular Caterpillars

open access: yesTheory and Applications of Graphs, 2020
A circular caterpillar of girth $n$ is a graph such that the removal of all pendant vertices yields a cycle $C_n$ of order $n$. A signed graph is a pair $\Gamma=(G, \sigma)$, where $G$ is a simple graph and $\sigma: E(G) \rightarrow \{+1, -1\}$ is the ...
Maurizio Brunetti
doaj   +1 more source

Home - About - Disclaimer - Privacy