Results 51 to 60 of about 832,958 (281)
On Minimum Generalized Degree Distance Index of Cyclic Graphs
International Journal of Mathematics and Mathematical Sciences, 2023 Topological index (TI) is a mapping that associates a real number to the under study (molecular) graph which predicts its various physical and chemical properties.
Nadia Khan +3 more
doaj +1 more source
Molecular Oncology, EarlyView.CDK11 inhibition stabilises the tumour suppressor p53 and triggers the production of an alternative p21WAF1 splice variant p21L, through the inactivation of the spliceosomal protein SF3B1. Unlike the canonical p21WAF1 protein, p21L is localised in the cytoplasm and has reduced cell cycle‐blocking activity.
Radovan Krejcir +12 more
wiley +1 more source
Clique cycle-transversals in distance-hereditary graphs
, 2013 A cycle-transversal of a graph G is a subset T of V(G) such that T intersects every cycle of G. A clique cycle-transversal, or cct for short, is a cycle-transversal which is a clique.
Brandstädt, Andreas +3 more
core +1 more source
Distance-regular Subgraphs in a Distance-regular Graph, IV
European Journal of Combinatorics, 1995 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +4 more sources
Liquid biopsy epigenetics: establishing a molecular profile based on cell‐free DNA
Molecular Oncology, EarlyView.Cell‐free DNA (cfDNA) fragments in plasma from cancer patients carry epigenetic signatures reflecting their cells of origin. These epigenetic features include DNA methylation, nucleosome modifications, and variations in fragmentation. This review describes the biological properties of each feature and explores optimal strategies for harnessing cfDNA ...
Christoffer Trier Maansson +2 more
wiley +1 more source
On Some Distance Spectral Characteristics of Trees
AxiomsGraham and Pollack in 1971 presented applications of eigenvalues of the distance matrix in addressing problems in data communication systems. Spectral graph theory employs tools from linear algebra to retrieve the properties of a graph from the spectrum ...
Sakander Hayat +2 more
doaj +1 more source
Distance 2-Domination in Prisms of Graphs
Discussiones Mathematicae Graph Theory, 2017 A set of vertices D of a graph G is a distance 2-dominating set of G if the distance between each vertex u ∊ (V (G) − D) and D is at most two. Let γ2(G) denote the size of a smallest distance 2-dominating set of G. For any permutation π of the vertex set
Hurtado Ferran +3 more
doaj +1 more source
Monophonic-triangular Distance in Graphs
Proyecciones (Antofagasta)A path u1, u2, ..., un in a connected graph G such that for i, j with j ≥ i + 3, there does not exist an edge uiuj , is called a monophonic-triangular path or mt-path. The monophonic-triangular distance or mt-distance dmt(u, v) from u to v is defined as the length of a longest u−v mt-path in G.
Titus, P. +2 more
openaire +2 more sources
Intein‐based modular chimeric antigen receptor platform for specific CD19/CD20 co‐targeting
Molecular Oncology, EarlyView.CARtein is a modular CAR platform that uses split inteins to splice antigen‐recognition modules onto a universal signaling backbone, enabling precise, scarless assembly without re‐engineering signaling domains. Deployed here against CD19 and CD20 in B‐cell malignancies, the design supports flexible multi‐antigen targeting to boost T‐cell activation and
Pablo Gonzalez‐Garcia +9 more
wiley +1 more source
Steiner Wiener index of graph products [PDF]
Transactions on Combinatorics, 2016 The Wiener index W(G) of a connected graph G is defined as W(G)=∑u,v∈V(G)dG(u,v) where dG(u,v) is the distance between the vertices u and v of G.
Yaoping Mao, Zhao Wang, Ivan Gutman
doaj