Results 71 to 80 of about 855,414 (324)
Conjectures About Wheels Without One Edge with Paths and Cycles
MathematicsThe crossing number cr(G) of a graph G is the minimum number of edge crossings over all drawings of G in the plane. The main aim of this paper is to give the crossing numbers of the join products G*+Pn and G*+Cn for the connected graph G* obtained by ...
Michal Staš, Mária Timková
doaj +1 more source
Product version of reciprocal degree distance of composite graphs
Communications in Combinatorics and Optimization, 2018 In this paper, we present the upper bounds for the product version of reciprocal degree distance of the tensor product, join and strong product of two graphs in terms of other graph invariants including the Harary index and Zagreb indices.
K. Pattabiraman
doaj +1 more source
Szeged-type indices of subdivision vertex-edge join (SVE-join)
Main Group Metal Chemistry, 2021 In this article, we compute the vertex Padmakar-Ivan (PIv) index, vertex Szeged (Szv) index, edge Padmakar-Ivan (PIe) index, edge Szeged (Sze) index, weighted vertex Padmakar-Ivan (wPIv) index, and weighted vertex Szeged (wSzv) index of a graph product ...
Asghar Syed Sheraz +4 more
doaj +1 more source
FEBS Letters, EarlyView.At low cell density, SETDB1 and YAP1 accumulate in the nucleus. As cell density increases, the Hippo pathway is gradually activated, and SETDB1 is associated with increased YAP1 phosphorylation. At high cell density, phosphorylated YAP1 is sequestered in the cytoplasm, while SETDB1 becomes polyubiquitinated and degraded by the ubiquitin–proteasome ...
Jaemin Eom +3 more
wiley +1 more source
International Journal of Mathematics for IndustryThis paper explores operations on fuzzy incidence graphs (FIGs), focusing on join, Cartesian product, tensor product, and composition. Emphasizing strong fuzzy incidence graphs (SFIGs), the study examines strong incidence domination (SID) and the strong ...
Kavya R. Nair, M. S. Sunitha
doaj +1 more source
Molecular Oncology, EarlyView.AZD9291 has shown promise in targeted cancer therapy but is limited by resistance. In this study, we employed metabolic labeling and LC–MS/MS to profile time‐resolved nascent protein perturbations, allowing dynamic tracking of drug‐responsive proteins. We demonstrated that increased NNMT expression is associated with drug resistance, highlighting NNMT ...
Zhanwu Hou +5 more
wiley +1 more source
Operations on Intuitionistic Fuzzy Graph Structures
Fuzzy Information and Engineering, 2016 An intuitionistic fuzzy graph structure (IFGS) is a generalization of an intuitionistic fuzzy graph. The concept of intuitionistic fuzzy graph structure is introduced and investigated in this paper.
Muhammad Akram, Rabia Akmal
doaj +1 more source
Fool’s solitaire on joins and Cartesian products of graphs
Discrete Mathematics, 2015 Peg solitaire is a game generalized to connected graphs by Beeler and Hoilman. In the game pegs are placed on all but one vertex. If $xyz$ form a 3-vertex path and $x$ and $y$ each have a peg but $z$ does not, then we can remove the pegs at $x$ and $y$ and place a peg at $z$. By analogy with the moves in the original game, this is called a jump.
Loeb, Sarah, Wise, Jennifer
openaire +3 more sources
YAP1::TFE3 mediates endothelial‐to‐mesenchymal plasticity in epithelioid hemangioendothelioma
Molecular Oncology, EarlyView.The YAP1::TFE3 fusion protein drives endothelial‐to‐mesenchymal transition (EndMT) plasticity, resulting in the loss of endothelial characteristics and gain of mesenchymal‐like properties, including resistance to anoikis, increased migratory capacity, and loss of contact growth inhibition in endothelial cells.
Ant Murphy +9 more
wiley +1 more source
The G-Convexity and the G-Centroids of Composite Graphs
Mathematics, 2020 The graph centroids defined through a topological property of a graph called g-convexity found its application in various fields. They have classified under the “facility location” problem.
Prakash Veeraraghavan
doaj +1 more source