Results 131 to 140 of about 732,396 (308)
Super Edge Bimagic and Trimagic Total Labeling for some Graphs. [PDF]
Alfarama Journal of Basic & Applied SciencesA super edge trimagic total labeling (SETTL) of a graph Γ with α vertices and β edges is a bijection Φ:[V (Γ) ∪ E(Γ)] ⟶{1,2,3,· · · ,α+β} such that for each edge ϑω∈E(Γ), the value of the formula [ Φ(ϑ)+Φ(ω)+Φ(ϑω)] is either Κ_1 or Κ_2 or Κ_3, with the ...
Mohamed R. Zeen El Deen +3 more
doaj +1 more source
On total transitivity of graphs
CoRRLet $G = (V, E)$ be a graph where $V$ and $E$ are the vertex and edge sets, respectively. For two disjoint subsets $A$ and $B$ of $V$, we say that $A$ \emph{dominates} $B$ if every vertex of $B$ is adjacent to at least one vertex of $A$. A vertex partition $π= \{V_1, V_2, \ldots, V_k\}$ of $G$ is called a \emph{transitive partition} of size $k$ if $V_i$
openaire +2 more sources
Molecular Oncology, EarlyView.Here, we demonstrate that HS1BP3 interacts with Cortactin through a proline‐rich region (PRR3.1) and show that this interaction, and HS1BP3 itself, promote cancer cell proliferation and invasion. Inhibition of this interaction leads to build‐up of TKS5 in multivesicular endosomes and altered secretion of CD63 and CD9, providing an explanation for the ...
Arja Arnesen Løchen +9 more
wiley +1 more source
Total Domination Polynomial of A Graph [PDF]
, 2014 A total domination polynomial of a graph $G$ of order $n$ is the polynomial $D_{td}(G,x) =\sum^n_{t=\gamma_{td}(G)}d_{td}(G,t)x^t$, where $d_{td}(G,t)$ is the number of total dominating sets of $G$ of cardinality $t$.
Chaitra, V., Chaluvaraju, B.
core
Total dominating sequences in graphs
Discrete Mathematics, 2016 A vertex in a graph totally dominates another vertex if they are adjacent. A sequence of vertices in a graph $G$ is called a total dominating sequence if every vertex $v$ in the sequence totally dominates at least one vertex that was not totally dominated by any vertex that precedes $v$ in the sequence, and at the end all vertices of $G$ are totally ...
Bostjan Bresar +2 more
openaire +2 more sources
Interpreting the effects of DNA polymerase variants at the structural level
Molecular Oncology, EarlyView.Using MAVISp and molecular dynamics simulations, we analyzed over 60 000 missense variants in POLE and POLD1 from ClinVar, COSMIC, cBioPortal, and saturation mutagenesis. Identified mechanistic indicators, including stability, binding, and long‐range, enable structural interpretation, providing ACMG‐like evidence for possible reclassification of VUS ...
Matteo Arnaudi +7 more
wiley +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
Discrete & Computational GeometryInspired by work of Fröberg (1990), and Eagon and Reiner (1998), we define the \emph{total $k$-cut complex} of a graph $G$ to be the simplicial complex whose facets are the complements of independent sets of size $k$ in $G$. We study the homotopy types and combinatorial properties of total cut complexes for various families of graphs, including chordal
Margaret Bayer +5 more
openaire +3 more sources
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
PEWARNAAN TOTAL PADA BEBERAPA GRAPH [PDF]
, 2001 TELAH DIKETAHUI BAHWA BILANGAN KROMATIK TOTAL GRAPH G MEMENUHI : XT(G) ≥∆(G)+1. KEMUDIAN M. BEHZAD DAN V.G.
NURI HENDRIANI, 089511317
core