Results 31 to 40 of about 620,857 (255)
Animation Visualization for Vertex Coloring of Polyhedral Graphs [PDF]
Vertex coloring of a graph is the assignment of labels to the vertices of the graph so that adjacent vertices have different labels. In the case of polyhedral graphs, the chromatic number is 2, 3, or 4. Edge coloring problem and face coloring problem can
Hidetoshi Nonaka
doaj
Modelling stem cell differentiation related processes—A practical overview for biologists
Stem cell differentiation is complex and difficult to control experimentally. This review introduces suitable computational modelling approaches that can support stem cell research, from mechanistic ODE and abstract models to multiscale and deep learning methods.
Ricco Zeegelaar +4 more
wiley +1 more source
Erdős-Gallai-Type Results for Total Monochromatic Connection of Graphs
A graph is said to be total-colored if all the edges and the vertices of the graph are colored. A total-coloring of a graph is a total monochromatically-connecting coloring (TMC-coloring, for short) if any two vertices of the graph are connected by a ...
Jiang Hui, Li Xueliang, Zhang Yingying
doaj +1 more source
IMPLEMENTASI ALGORITMA GREEDY UNTUK MELAKUKAN GRAPH COLORING: STUDI KASUS PETA PROPINSI JAWA TIMUR
This paper will describe us how to coloring a graph by using greedy algorithm with the case study province of Jawa Timur. From this research we will know that for graph coloring at Jawa Timur Province only use four difference colors.
Ardiansyah Ardiansyah +5 more
doaj +1 more source
Asymmetric game perfect graphs and the circular coloring game of weighted graphs [PDF]
Zacharopoulos P. Asymmetric game perfect graphs and the circular coloring game of weighted graphs.
Zacharopoulos, Panagiotis
core
The role of miR‐335‐5p in the redifferentiation of BRAF p.V600E thyroid cancers
The BRAF p.V600E mutation promotes thyroid cancer dedifferentiation and radioiodine resistance. Using a network approach, we identified miR‐335‐5p as a key regulator of BRAF‐mutated thyroid tumors. Restoring miR‐335‐5p increased thyroid‐specific gene expression and iodine uptake in cells and organoids.
Valeria Pecce +11 more
wiley +1 more source
Rainbow Connection on Amal(Fn,xz,m) Graphs and Amal(On,xz,m) Graphs
Coloring graph is giving a color to a set of vertices and a set of edges on a graph. The condition for coloring a graph is that each color is different for each neighboring member graph.
Muhammad Usaid Hudloir +4 more
doaj +1 more source
In this explorative study, the abundance of circular RNA molecules in bone marrow stem cells was found to be elevated in patients with high‐risk myelodysplastic neoplasms, and to be associated with an increased risk of progression to acute myeloid leukemia.
Eileen Wedge +17 more
wiley +1 more source
Pewarnaan Titik Ketakteraturan Lokal Inklusif pada Hasil Operasi Comb Graf Bintang
Let G(V,E) is a simple graph and connected where V(G) is vertex set and E(G) is edge set. An inclusive local irregularity vertex coloring is defined by a mapping l:V(G) í {1,2,..., k} as vertex labeling and wi : V(G) í N is function of inclusive local ...
Arika Indah Kristiana +2 more
doaj +1 more source
On Maximum Differential Graph Coloring
We study the maximum differential graph coloring problem, in which the goal is to find a vertex labeling for a given undirected graph that maximizes the label difference along the edges.
Sankar Veeramoni +5 more
core +1 more source

