Results 131 to 140 of about 18,582 (315)
A New Kind of Dominated Coloring of Some Special Graphs
This paper introduces the concept of locating-dominated coloring, a new graph coloring parameter that merges the properties of dominated coloring and locating coloring.
F. Poryousefi, A. Erfanian, M. Nasiri
doaj +1 more source
ABSTRACT Objective Considerable efforts have been dedicated to developing effective treatments for post‐stroke executive impairment (PSEI), among which repetitive transcranial magnetic stimulation (rTMS) has shown great potential. This study aimed to investigate the therapeutic effects of high‐frequency rTMS on working memory (WM) and response ...
Mengting Lao +6 more
wiley +1 more source
The Coloring Graph of Complete Graphs
We study the coloring graph of the family of complete graphs and we prove that Cn(Kt) is regular, transitive, and connected when n>t. Also, we study whether Cn(Kt) is distance transitive or strongly regular, and find its diameter.
openaire +2 more sources
Oriented Coloring on Recursively Defined Digraphs
Coloring is one of the most famous problems in graph theory. The coloring problem on undirected graphs has been well studied, whereas there are very few results for coloring problems on directed graphs. An oriented k-coloring of an oriented graph G =
Frank Gurski +2 more
doaj +1 more source
ABSTRACT Objective Variants in SLC6A1, encoding the GABA transporter 1 (GAT‐1), cause epilepsy, autism spectrum disorder, and developmental delay via loss of GABA uptake, impaired trafficking, and ER retention. We previously found that 4‐Phenylbutyrate (PBA), an FDA‐approved drug, restores GABA uptake and reduces seizures in SLC6A1‐related disorders ...
Melissa B. DeLeeuw +5 more
wiley +1 more source
A graph’s b-coloring admits proper coloring and has the extra characteristic of having a dominating node in each color-class in the graph. [Formula: see text] the b-chromatic number, is the largest integer k for which G can be colored with k colors using
Foram Chandarana +5 more
doaj +1 more source
RGB Color Cluster and Graph Coloring Algorithm for Partial Color Blind Correction
Partial color blindness is an anomaly occurring to 5-8% of the world's population. Color correction using re-coloring algorithm usually can be used to help partial color blindness patient.
Dody Qori Utama +4 more
doaj +1 more source
Monotonic Stable Solutions for Minimum Coloring Games
For the class of minimum coloring games (introduced by Deng et al. (1999)) we investigate the existence of population monotonic allocation schemes (introduced by Sprumont (1990)).
Miquel, S., Norde, H.W., Hamers, H.J.M.
core
ABSTRACT Objective Facioscapulohumeral muscular dystrophy (FSHD) is one of the most debilitating and common muscular dystrophies. Despite its severity, no approved therapy exists for FSHD patients. However, several therapeutic candidates are currently under development, and some have recently entered clinical trials, marking the need for reliable ...
Mustafa Bilal Bayazit +11 more
wiley +1 more source
Better Coloring of 3-Colorable Graphs
To appear in STOC ...
Ken-ichi Kawarabayashi +2 more
openaire +3 more sources

