Results 101 to 110 of about 919,081 (302)

SUPER EDGE MAGIC TOTAL LABELING PADA GRAPH -CYCLE BOOKS UNTUK

open access: yes, 2022
Misal adalah graph dengan himpunan vertex dan himpunan edge . Misal fungsi adalah edge magic total labeling pada . Fungsi disebut super edge magic total labeling pada bila ( ) dimana . Graph yang diteliti pada penelitian ini adalah graph -cyle books .
Ningsih, Reni Widya   +2 more
core   +2 more sources

CEACAM1 participation in breast cancer progression

open access: yesMolecular Oncology, EarlyView.
In invasive breast cancer (BC), CEACAM1 shifts from an apical to a uniform membranous/cytoplasmic pattern, or is lost, as tumors dedifferentiate, inversely tracking the Ki‐67 proliferative index. In MCF‐7 cells, only CEACAM1‐4L suppresses proliferation, repressing cell cycle and growth factor genes.
Mykola Lyndin   +3 more
wiley   +1 more source

EDGE MAGIC TOTAL LABELING PADA GRAPH -CYCLE BOOKS B(7,1,4,2) [PDF]

open access: yes, 2017
Edge magic total labeling pada graph adalah fungsi bijektif , dimana | | dan | | sedemikian sehingga dan berlaku ; untuk beberapa konstanta . Salah satu penelitian yang menarik adalah edge magic total labeling pada graph -cycle books .
Baki, Swita   +2 more
core   +1 more source

Partial FAK suppression promotes tumor growth, an effect reversed by macrophage p110δ PI3K inactivation

open access: yesMolecular Oncology, EarlyView.
Partial inhibition of focal adhesion kinase (FAK) can paradoxically promote tumor growth, rather than simply producing a weaker antitumor effect than that observed with strong FAK suppression. In breast cancer and melanoma models, targeting p110δ PI3K, particularly in macrophages, counteracted these tumor‐promoting effects, highlighting the importance ...
Lydia Xenou   +4 more
wiley   +1 more source

Labeling angles of planar graphs

open access: yesDiscrete Mathematics, 1988
By a well-known theorem of Heawood, 3-edge-coloring bridgeless planar cubic graphs is equivalent to labeling vertices with \(+1\) or -1 so that the sum around any face is 0(mod 3). The authors introduce the notion of ``angle-labeling'' and prove results analogous to Heawood's for bridgeless planar graphs with vertices of degree 2 or 3; the angles and ...
Feodor Loupekine, John J. Watkins
openaire   +2 more sources

Paclitaxel induces NM2‐dependent cellular contraction through GEF‐H1 dissociation from microtubules and RhoA/ROCK activation in cancer cells

open access: yesMolecular Oncology, EarlyView.
Taxanes are widely used chemotherapeutics whose effects on cellular mechanics remain poorly understood. We show that paclitaxel induces rapid cellular contraction by promoting GEF‐H1 dissociation from microtubules and non‐muscle myosin II activation through RhoA/ROCK.
Gloria Asensio‐Juárez   +5 more
wiley   +1 more source

p190A/ARHGAP35 and p190B/ARHGAP5 proteins in endometrial cancer: a novel cancer‐relevant paralog interplay

open access: yesMolecular Oncology, EarlyView.
This study identifies ARHGAP5, in addition to the frequently mutated ARHGAP35, as significantly mutated in endometrial cancer. Mutations in both genes co‐occur and are associated with their correlated downregulation. Functional CRISPR studies show that both paralogs regulate similar pathways, including actin cytoskeleton organization.
Mathilde Pinault   +12 more
wiley   +1 more source

SPHINX31 acts as a SRPK1 inhibitor targeting the ATR/DNA‐PKcs/CHK1 replicative checkpoint to inhibit cell growth in non‐small cell lung cancer

open access: yesMolecular Oncology, EarlyView.
The kinase SRPK1 directly interacts with the protein TOPBP1 and regulates the pre‐mRNA splicing of WIZ thereby contributing to the activation of the ATR/CHK1 replicative checkpoint in response to replicative stress. This allows cancer cells' genomic stability and survival.
Amani Shreim   +17 more
wiley   +1 more source

Odd harmonious labeling on the union of flower graphs

open access: yesDesimal
Applications of graph labeling in the fields of communication network addressing, database management, secret sharing schemes, and cryptology. Graphs that satisfy the odd harmonious labeling property are called odd harmonious graphs.
Fery Firmansah   +2 more
doaj   +1 more source

关于边-多重路替换图的1,2,3-猜想和1,2-猜想(1,2,3-conjecture and 1,2-conjecture for the edge-multiplicity-paths-replacements)

open access: yesZhejiang Daxue xuebao. Lixue ban, 2016
Let f:E(G)→Z+ be an edge-weighting (labeing) of a graph G. For each v∈V(G) , if yields a proper coloring of the graph, then f is defined as a neighbour-distinguishing edge labeling of G. Let g: V(G) ∪ E(G)→Z+ be a total-weighting (labeing) of a graph G.
LYUDamei(吕大梅)   +1 more
doaj   +1 more source

Home - About - Disclaimer - Privacy