Results 61 to 70 of about 84,087 (307)

On Twin Edge Colorings of Graphs

open access: yesDiscussiones Mathematicae Graph Theory, 2014
A twin edge k-coloring of a graph G is a proper edge coloring of G with the elements of Zk so that the induced vertex coloring in which the color of a vertex v in G is the sum (in Zk) of the colors of the edges incident with v is a proper vertex coloring.
Andrews Eric   +4 more
doaj   +1 more source

ATF4‐mediated stress response as a therapeutic vulnerability in chordoma

open access: yesMolecular Oncology, EarlyView.
We screened 5 chordoma cell lines against 100+ inhibitors of epigenetic and metabolic pathways and kinases and identified halofuginone, a tRNA synthetase inhibitor. Mechanistically halofuginone induces an integrated stress response, with eIF2alpha phosphorylation, activation of ATF4 and its target genes CHOP, ASNS, INHBE leading to cell death ...
Lucia Cottone   +11 more
wiley   +1 more source

Relaxed DP-Coloring and another Generalization of DP-Coloring on Planar Graphs without 4-Cycles and 7-Cycles

open access: yesDiscussiones Mathematicae Graph Theory, 2023
DP-coloring is generalized via relaxed coloring and variable degeneracy in [P. Sittitrai and K. Nakprasit, Su cient conditions on planar graphs to have a relaxed DP-3-coloring, Graphs Combin. 35 (2019) 837–845], [K.M. Nakprasit and K.
Sribunhung Sarawute   +3 more
doaj   +1 more source

Pewarnaan Titik Ketakteraturan Lokal Inklusif pada Keluarga Graf Unicyclic

open access: yesContemporary Mathematics and Applications (ConMathA), 2022
The graph in this paper is a simple and connected graph with V(G) is vertex set and  E(G) is edge set. An inklusif local irregularity vertex coloring is defined should be maping l:V(G) í  {1,2,..., k} as vertex labeling and wi : V(G) í  N is function of ...
Arika Indah Kristiana   +2 more
doaj   +1 more source

Vertex coloring of plane graphs with nonrepetitive boundary paths

open access: yes, 2011
A sequence $s_1,s_2,...,s_k,s_1,s_2,...,s_k$ is a repetition. A sequence $S$ is nonrepetitive, if no subsequence of consecutive terms of $S$ form a repetition. Let $G$ be a vertex colored graph.
Alon   +12 more
core   +1 more source

Plecstatin inhibits hepatocellular carcinoma tumorigenesis and invasion through cytolinker plectin

open access: yesMolecular Oncology, EarlyView.
The ruthenium‐based metallodrug plecstatin exerts its anticancer effect in hepatocellular carcinoma (HCC) primarily through selective targeting of plectin. By disrupting plectin‐mediated cytoskeletal organization, plecstatin inhibits anchorage‐dependent growth, cell polarization, and tumor cell dissemination.
Zuzana Outla   +10 more
wiley   +1 more source

The identification numbers of lollipop graphs

open access: yesAIMS Mathematics
A nontrivial connected graph $ G $ with diameter $ d $ can be assigned a red-white coloring, where the vertices of $ G $ are colored either red or white, with the stipulation that at least one vertex must be red. Associated with each vertex $ v $ of $ G $
Gaixiang Cai, Fengru Xiao, Guidong Yu
doaj   +1 more source

MATHEMATICA APPLICATION FOR GRAPH COLORING AT THE INTERSECTION OF JALAN PANGERAN ANTASARI JAKARTA

open access: yesAksioma: Jurnal Program Studi Pendidikan Matematika, 2017
This research examines about graph coloring using Welch-Powell algorithm. This research begins by trying to understand about graph coloring and its algorithm. The case study was conducted at the intersection of Pangeran Antasari Street.
Suwarno Suwarno
doaj   +1 more source

A linear algorithm for the grundy number of a tree

open access: yes, 2014
A coloring of a graph G = (V,E) is a partition {V1, V2, . . ., Vk} of V into independent sets or color classes. A vertex v Vi is a Grundy vertex if it is adjacent to at least one vertex in each color class Vj .
Bouhlel, Mohamed Salim, Mansouri, Ali
core   +1 more source

Home - About - Disclaimer - Privacy