Results 81 to 90 of about 544,762 (274)
Urinary LGALS3BP is elevated in bladder cancer patients compared to healthy controls as detected by the 1959 antibody–based ELISA. The antibody shows enhanced reactivity to the high‐mannose glycosylated variant secreted by cancer cells treated with kifunensine (KIF).
Asia Pece +18 more
wiley +1 more source
On Certain Products of Complex Intuitionistic Fuzzy Graphs
A complex intuitionistic fuzzy set (CIFS) can be used to model problems that have both intuitionistic uncertainty and periodicity. A diagram composed of nodes connected by lines and labeled with specific information may be used to depict a wide range of ...
Abida Anwar, Faryal Chaudhry
doaj +1 more source
Survivin and Aurora Kinase A control cell fate decisions during mitosis
Aurora A interacts with survivin during mitosis and regulates its centromeric role. Loss of Aurora A activity mislocalises survivin, the CPC and BubR1, leading to disruption of the spindle checkpoint and triggering premature mitotic exit, which we refer to as ‘mitotic slippage’.
Hana Abdelkabir +2 more
wiley +1 more source
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
Italian Domination Number for Strong Product of Cycles and Paths
This paper mainly considers the Italian domination number for strong product of cycles and paths. After constructing some recursive Italian dominating functions, we derive the upper bounds for the Italian domination number of strong product of cycles and
Liyang Wei, Feng Li
doaj +1 more source
Graph product plays a key role in many applications of graph theory because many large graphs can be constructed from small graphs by using graph products. Here, we discuss two of the most frequent graph-theoretical products. Let G1 and G2 be two graphs.
Muhammad Shoaib Sardar +3 more
doaj +1 more source
A Lexicographic Product Cancellation Property for Digraphs [PDF]
There are four prominent product graphs in graph theory: Cartesian, strong, direct, and lexicographic. Of these four product graphs, the lexicographic product graph is the least studied.
Manion, Kendall
core +1 more source
Edge-connectivity of strong products of graphs
The strong product G1 £G2 of graphs G1 and G2 is the graph with V (G1) × V (G2) as the vertex set, and two distinct vertices (x1, x2) and (y1, y2) are adjacent whenever for each i ∈ {1, 2} either xi = yi or xiyi ∈ E(Gi). In this note we show that for two connected graphs G1 and G2 the edge-connectivity λ(G1£G2) equals min{δ(G1£ G2), λ(G1)(|V (G2)|+2|E ...
Brešar, Boštjan, Špacapan, Simon
openaire +3 more sources
Liquid biopsy epigenetics: establishing a molecular profile based on cell‐free DNA
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
Novel Neutrosophic Cubic Graphs Structures With Application in Decision Making Problems
Graphs allow us to study the different patterns of inside the data by making a mental image. The aim of this paper is to develop a neutrosophic cubic graph structure, which is the extension of neutrosophic cubic graphs.
Muhammad Gulistan +4 more
doaj +1 more source

