Results 71 to 80 of about 2,598,126 (331)
On balanced cycle domination of graphs
AKCE International Journal of Graphs and Combinatorics, 2023 Let [Formula: see text] be a graph. A function [Formula: see text] is said to be a balanced cycle dominating function (BCDF) of [Formula: see text] if [Formula: see text] holds for any induced cycle [Formula: see text] of [Formula: see text] The balanced
Baogen Xu +3 more
doaj +1 more source
Molecular Oncology, EarlyView.Circulating tumor DNA (ctDNA) offers a possibility for different applications in early and late stage breast cancer management. In early breast cancer tumor informed approaches are increasingly used for detecting molecular residual disease (MRD) and early recurrence. In advanced stage, ctDNA provides a possibility for monitoring disease progression and
Eva Valentina Klocker +14 more
wiley +1 more source
Circulating tumor cells: advancing personalized therapy in small cell lung cancer patients
Molecular Oncology, EarlyView.Small cell lung cancer (SCLC) is an aggressive form of lung cancer that spreads rapidly to secondary sites such as the brain and liver. Cancer cells circulating in the blood, “circulating tumor cells” (CTCs), have demonstrated prognostic value in SCLC, and evaluating biomarkers on CTCs could guide treatment decisions such as for PARP inhibitors ...
Prajwol Shrestha +6 more
wiley +1 more source
On the signed Italian domination of graphs [PDF]
Computer Science Journal of Moldova, 2019 A signed Italian dominating function on a graph $G=(V,E)$ is a function $f:V\to \{ -1, 1, 2 \}$ satisfying the condition that for every vertex $u$, $f[u]\ge 1$. The weight of signed Italian dominating function is the value $f(V)=\sum_{u\in V}f(u)$.
Ashraf Karamzadeh +2 more
doaj
Bipartite Consensus Problems on Second-Order Signed Networks With Heterogeneous Topologies
IEEE Access, 2020 This paper is devoted to the convergence problem for second-order signed networks that are associated with two signed graphs in the presence of heterogeneous topologies.
Jianheng Ling +2 more
doaj +1 more source
Discrete Applied Mathematics, 1980 AbstractA class of signed digraphs which arises naturally, in the theory of sign solvable linear systems is introduced. Several results are obtained concerning the structure of such graphs. Also an application is made revealing much of the structure of matrices of sign-solvable systems.
openaire +2 more sources
On the Laplacian coefficients of signed graphs
Linear Algebra and its Applications, 2015 Abstract Let Γ = ( G , σ ) be a signed graph, where G is its underlying graph and σ its sign function (defined on edges of G). A signed graph Γ ′ , the subgraph of Γ, is its signed TU-subgraph if the signed graph induced by the vertices of Γ ′ consists of trees and/or unbalanced unicyclic signed graphs. Let L (
Slobodan K. Simić +2 more
openaire +5 more sources
Cell‐free and extracellular vesicle microRNAs with clinical utility for solid tumors
Molecular Oncology, EarlyView.Cell‐free microRNAs (cfmiRs) are small‐RNA circulating molecules detectable in almost all body biofluids. Innovative technologies have improved the application of cfmiRs to oncology, with a focus on clinical needs for different solid tumors, but with emphasis on diagnosis, prognosis, cancer recurrence, as well as treatment monitoring.
Yoshinori Hayashi +6 more
wiley +1 more source
The complexity of signed graph and edge-coloured graph homomorphisms
, 2016 We study homomorphism problems of signed graphs from a computational point of view. A signed graph $(G,\Sigma)$ is a graph $G$ where each edge is given a sign, positive or negative; $\Sigma\subseteq E(G)$ denotes the set of negative edges.
Brewster, Richard C. +3 more
core +1 more source
On colorings and orientations of signed graphs [PDF]
Discrete Mathematics Letters, 2023 Daniel Slilaty
doaj +1 more source