Results 91 to 100 of about 2,422,838 (348)

- and -labeling problems on interval graphs

open access: yesAKCE International Journal of Graphs and Combinatorics, 2017
For a given graph , the - and -labeling problems assign the labels to the vertices of . Let be the set of non-negative integers. An - and -labeling of a graph is a function such that , for respectively, where represents the distance (minimum number of ...
Sk Amanathulla, Madhumangal Pal
doaj   +1 more source

On Lh,k-Labeling Index of Inverse Graphs Associated with Finite Cyclic Groups

open access: yesJournal of Mathematics, 2021
An Lh,k-labeling of a graph G=V,E is a function f:V⟶0,∞ such that the positive difference between labels of the neighbouring vertices is at least h and the positive difference between the vertices separated by a distance 2 is at least k.
K. Mageshwaran   +4 more
doaj   +1 more source

Thermal proteome profiling and proteome analysis using high‐definition mass spectrometry demonstrate modulation of cholesterol biosynthesis by next‐generation galeterone analog VNPP433‐3β in castration‐resistant prostate cancer

open access: yesMolecular Oncology, EarlyView.
Elevated level of cholesterol is positively correlated to prostate cancer development and disease severity. Cholesterol‐lowering drugs, such as statins, are demonstrated to inhibit prostate cancer. VNPP433‐3β interrupts multiple signaling and metabolic pathways, including cholesterol biosynthesis, AR‐mediated transcription of several oncogenes, mRNA 5′
Retheesh S. Thankan   +10 more
wiley   +1 more source

Novel Properties of Fuzzy Labeling Graphs

open access: yesJournal of Mathematics, 2014
The concepts of fuzzy labeling and fuzzy magic labeling graph are introduced. Fuzzy magic labeling for some graphs like path, cycle, and star graph is defined. It is proved that every fuzzy magic graph is a fuzzy labeling graph, but the converse is not
A. Nagoor Gani   +2 more
doaj   +1 more source

Computing The Irregularity Strength of Planar Graphs

open access: yesMathematics, 2018
The field of graph theory plays a vital role in various fields. One of the important areas in graph theory is graph labeling used in many applications such as coding theory, X-ray crystallography, radar, astronomy, circuit design, communication network ...
Hong Yang   +4 more
doaj   +1 more source

Elucidating prognostic significance of purine metabolism in colorectal cancer through integrating data from transcriptomic, immunohistochemical, and single‐cell RNA sequencing analysis

open access: yesMolecular Oncology, EarlyView.
Low expression of five purine metabolism‐related genes (ADSL, APRT, ADCY3, NME3, NME6) was correlated with poor survival in colorectal cancer. Immunohistochemistry analysis showed that low NME3 (early stage) and low ADSL/NME6 (late stage) levels were associated with high risk.
Sungyeon Kim   +8 more
wiley   +1 more source

Escape from TGF‐β‐induced senescence promotes aggressive hallmarks in epithelial hepatocellular carcinoma cells

open access: yesMolecular Oncology, EarlyView.
Chronic TGF‐β exposure drives epithelial HCC cells from a senescent state to a TGF‐β resistant mesenchymal phenotype. This transition is characterized by the loss of Smad3‐mediated signaling, escape from senescence, enhanced invasiveness and metastatic potential, and upregulation of key resistance modulators such as MARK1 and GRM8, ultimately promoting
Minenur Kalyoncu   +11 more
wiley   +1 more source

Targeting the AKT/mTOR pathway attenuates the metastatic potential of colorectal carcinoma circulating tumor cells in a murine xenotransplantation model

open access: yesMolecular Oncology, EarlyView.
Dual targeting of AKT and mTOR using MK2206 and RAD001 reduces tumor burden in an intracardiac colon cancer circulating tumor cell xenotransplantation model. Analysis of AKT isoform‐specific knockdowns in CTC‐MCC‐41 reveals differentially regulated proteins and phospho‐proteins by liquid chromatography coupled mass spectrometry. Circulating tumor cells
Daniel J. Smit   +19 more
wiley   +1 more source

α_{2}-labeling of graphs [PDF]

open access: yesOpuscula Mathematica, 2009
We show that if a graph \(G\) on \(n\) edges allows certain special type of rosy labeling (a.k.a. \(\rho\)-labeling), called \(\alpha_2\)-labeling, then for any positive integer \(k\) the complete graph \(K_{2nk+1}\) can be decomposed into copies of \(G\)
Dalibor Fronček
doaj   +1 more source

Topological Integer Additive Set-Sequential Graphs

open access: yes, 2015
Let $\mathbb{N}_0$ denote the set of all non-negative integers and $X$ be any non-empty subset of $\mathbb{N}_0$. Denote the power set of $X$ by $\mathcal{P}(X)$. An integer additive set-labeling (IASL) of a graph $G$ is an injective set-valued function $
Augustine, Germina   +2 more
core   +2 more sources

Home - About - Disclaimer - Privacy