Synthesis and Coloring Mechanism of Metallic Glaze in R_(2)O-RO-Al_(2)O_(3)-SiO_(2)-P_(2)O_(5)System

A copper-red and silver-white metallic glaze of R_(2)O-RO-Al_(2)O_(3)-SiO_(2)-P_(2)O_(5)system was synthesized by adjusting the firing temperature and glaze components.The coloration mechanism of the metallic glaze was revealed via investigation of the microstructure of the glaze.Our research reveals that the metallic glaze with different colors is mainly due to the amount of Fe_(2)O_(3).The metallic glaze shows a silver-white luster due to a structural color ofα-Fe_(2)O_(3)crystals with a good orientation when the sample contains 0.0939 mol of Fe_(2)O_(3),maintaining temperatures at 1150℃for 0.5 h.The metallic glaze is copper-red which is dominated by the coupling of chemical and structural color ofα-Fe_(2)O_(3)crystals when the sample contains 0.0783 mol of Fe_(2)O_(3).After testing the amount of SiO_(2),we find that 4.0499 mol is the optimal amount to form the ceramic network,and 0.27 mol AlPO_(4)is the best amount to promote phase separation.

E-Total Coloring of Complete Bipartite Graphs K_(5,n)(5≤n≤7 113)Which Are Vertex-Distinguished by Multiple Sets

In this study,using the method of contradiction and the pre-assignment of chromatic sets,we discuss the E-total coloring of complete bipartite graphs K_(5,n)(5≤n≤7 113) which are vertex-distinguished by multiple sets.The vertex-distinguishing E-total chromatic numbers of this kind of graph are determined.

A Cognitive Psychological Study on the Acquisition of Chinese Word’s Coloring Meaning--Chinese as a Second Language

Lexical meaning mainly includes rational meaning,grammatical meaning,and coloring meaning.Mastering the coloring meaning of vocabulary is of great significance for foreign students to use Chinese vocabulary correctly.This study mainly examines the psychological mechanism of Chinese second language learners mastering the coloring meaning of words,examines the psychological characteristics of students mastering the color meaning of words from the perspectives of second language learning theory and cognitive theory,establishes a cognitive schema for coloring meaning learning,and proposes corresponding learning models and teaching strategies.

A Map Coloring Method

Different vertices are colored in a plan. Adjacent vertices are colored dif-ferently from nonadjacent vertices, which are colored the same color. One color is used for a single point, two colors are used for points without a loop, and a maximum of four colors are used for points with a loop. A maximum of four colors are used to color all points. .

Note on Cyclically Interval Edge Colorings of Simple Cycles

A proper edge t-coloring of a graph G is a coloring of its edges with colors 1, 2,..., t, such that all colors are used, and no two adjacent edges receive the same color. A cyclically interval t-coloring of a graph G is a proper edge t-coloring of G such that for each vertex, either the set of colors used on edges incident to x or the set of colors not used on edges incident to x forms an interval of integers. In this paper, we provide a new proof of the result on the colors in cyclically interval edge colorings of simple cycles which was first proved by Rafayel R. Kamalian in the paper “On a Number of Colors in Cyclically Interval Edge Colorings of Simple Cycles, Open Journal of Discrete Mathematics, 2013, 43-48”.

Vertex-distinguishing E-total Coloring of Complete Bipartite Graph K 7,n when7≤n≤95

Let G be a simple graph. A total coloring f of G is called an E-total coloring if no two adjacent vertices of G receive the same color, and no edge of G receives the same color as one of its endpoints. For an E-total coloring f of a graph G and any vertex x of G, let C（x） denote the set of colors of vertex x and of the edges incident with x, we call C（x） the color set of x. If C（u） ≠ C（v） for any two different vertices u and v of V （G）, then we say that f is a vertex-distinguishing E-total coloring of G or a VDET coloring of G for short. The minimum number of colors required for a VDET coloring of G is denoted by Хvt^e（G） and is called the VDE T chromatic number of G. The VDET coloring of complete bipartite graph K7,n （7 ≤ n ≤ 95） is discussed in this paper and the VDET chromatic number of K7,n （7 ≤ n ≤ 95） has been obtained.

Vertex-distinguishing Total Colorings of 2Cn

Let f be a proper total k-coloring of a simple graph G. For any vertex x ∈ V（G）, let Cf（x） denote the set of colors assigned to vertex x and the edges incident with x. If Cf（u） ≠ Cf（v） for all distinct vertices u and v of V（G）, then f is called a vertex- distinguishing total k-coloring of G. The minimum number k for which there exists a vertex- distinguishing total k-coloring of G is called the vertex-distinguishing total chromatic number of G and denoted by Xvt（G）. The vertex-disjoint union of two cycles of length n is denoted by 2Cn. We will obtain Xvt（2Cn） in this paper.

Vertex-distinguishing VE-total Colorings of Cycles and Complete Graphs

Let G be a simple graph of order at least 2.A VE-total-coloring using k colors of a graph G is a mapping f from V (G) E(G) into {1,2,···,k} such that no edge receives the same color as one of its endpoints.Let C(u)={f(u)} {f(uv) | uv ∈ E(G)} be the color-set of u.If C(u)=C(v) for any two vertices u and v of V (G),then f is called a k-vertex-distinguishing VE-total coloring of G or a k-VDVET coloring of G for short.The minimum number of colors required for a VDVET coloring of G is denoted by χ ve vt (G) and it is called the VDVET chromatic number of G.In this paper we get cycle C n,path P n and complete graph K n of their VDVET chromatic numbers and propose a related conjecture.

Vertex-distinguishing IE-total Colorings of Cycles and Wheels

Let G be a simple graph. An IE-total coloring f of G refers to a coloring of the vertices and edges of G so that no two adjacent vertices receive the same color. Let C（u） be the set of colors of vertex u and edges incident to u under f. For an IE-total coloring f of G using k colors, if C（u）=C（v） for any two different vertices u and v of V （G）, then f is called a k-vertex-distinguishing IE-total-coloring of G, or a k-VDIET coloring of G for short. The minimum number of colors required for a VDIET coloring of G is denoted by χievt（G）, and is called the VDIET chromatic number of G. We get the VDIET chromatic numbers of cycles and wheels, and propose related conjectures in this paper.

On the adjacent vertex-distinguishing acyclic edge coloring of some graphs

A proper edge coloring of a graph G is called adjacent vertex-distinguishing acyclic edge coloring if there is no 2-colored cycle in G and the coloring set of edges incident with u is not equal to the coloring set of edges incident with v, where uv∈ E（G）. The adjacent vertex distinguishing acyclic edge chromatic number of G, denoted by X＇Aa（G）, is the minimal number of colors in an adjacent vertex distinguishing acyclic edge coloring of G. If a graph G has an adjacent vertex distinguishing acyclic edge coloring, then G is called adjacent vertex distinguishing acyclic. In this paper, we obtain adjacent vertex-distinguishing acyclic edge coloring of some graphs and put forward some conjectures.

Vertex-distinguishing IE-total Colorings of Complete Bipartite Graphs K8,n

Let G be a simple graph. An IE-total coloring f of G is a coloring of the vertices and edges of G so that no two adjacent vertices receive the same color. For each vertex x of G, let C(x) be the set of colors of vertex x and edges incident to x under f. For an IE-total coloring f of G using k colors, if C(u) ≠ C(v) for any two different vertices u and v of G, then f is called a k-vertex-distinguishing IE-total-coloring of G or a k-VDIET coloring of G for short. The minimum number of colors required for a VDIET coloring of G is denoted by χ_(vt)^(ie) (G) and is called vertex-distinguishing IE-total chromatic number or the VDIET chromatic number of G for short. The VDIET colorings of complete bipartite graphs K_(8,n)are discussed in this paper. Particularly, the VDIET chromatic number of K_(8,n) are obtained.

Three-Rainbow Coloring of Split Graphs

After a necessary condition is given, 3-rainbow coloring of split graphs with time complexity O(m) is obtained by constructive method. The number of corresponding colors is at most 2 or 3 more than the minimum number of colors needed in a 3-rainbow coloring.

ON EQUITABLE VERTEX DISTINGUISHING EDGE COLORINGS OF TREES

It has been known that determining the exact value of vertex distinguishing edge index X ＇8（G） of a graph G is difficult, even for simple classes of graphs such as paths, cycles, bipartite complete graphs, complete, graphs, and graphs with maximum degree 2. Let rid（G） denote the number of vertices of degree d in G, and let X＇es（G） be the equitable vertex distinguishing edge index of G. We show that a tree T holds nl （T） ≤ X ＇s （T） ≤ n1 （T） ＋ 1 and X＇s（T） = X＇es（T） if T satisfies one of the following conditions （i） n2（T） ≤△（T） or （ii） there exists a constant c with respect to 0 〈 c 〈 1 such that n2（T） △ cn1（T） and ∑3 ≤d≤△（T）nd（T） ≤ （1 - c）n1（T） ＋ 1.

Adjacent Vertex Distinguishing Total Coloring of M（Tn）

A k-proper total coloring of G is called adjacent distinguishing if for any two adjacent vertices have different color sets. According to the property of trees, the adjacent vertex distinguishing total chromatic number will be determined for the Mycielski graphs of trees using the method of induction.

Majority Coloring of r-Regular Digraph

A majority k-coloring of a digraph D with k colors is an assignment c:V(D)→{1,2,…,k},such that for every v∈V(D),we have c(w)=c(v)for at most half of all out-neighbors w∈N^(+)(v).For a natural number k≥2,a 1/k-majority coloring of a digraph is a coloring of the vertices such that each vertex receives the same color as at most a 1/k proportion of its out-neighbours.Kreutzer,Oum,Seymour,van der Zypen and Wood proved that every digraph has a majority 4-coloring and conjectured that every digraph admits a majority 3-coloring.Gireao,Kittipassorn and Popielarz proved that every digraph has a 1/k-majority 2k-coloring and conjectured that every digraph admits a 1/k majority(2k-1)-coloring.We showed that every r-regular digraph D with r>36ln(2n)has a majority 3-coloring and proved that every digraph D with minimum outdegreeδ+>2k2(2k-1)/(k-1)^(2)ln2(n)[(2k-1)n]has a 1/k-majority(2k-1)-coloring.We showed that every r-regular digraph D with r>36ln(2n)has a majority 3-coloring and proved that every digraph D with minimum outdegreeδ+>,2k^(2)(2k-1)^(2)/(k-1)^(2)ln[(2k-1)n]has a 1/k-majority(2k-1)-coloring.And we also proved that every r-regular digraph D with r>3k^(2)(2k-1)/(k-1)^2ln(2n)has a 1/k-majority(2k-1)-coloring.

On the Maximum Number of Dominating Classes in Graph Coloring

We investigate the dominating-c-color number,, of a graph G. That is the maximum number of color classes that are also dominating when G is colored using colors. We show that where is the join of G and . This result allows us to construct classes of graphs such that and thus provide some information regarding two questions raised in [1] and [2].

A Method for Trust Management in Cloud Computing: Data Coloring by Cloud Watermarking

With the development of Internet technology and human computing, the computing environment has changed dramatically over the last three decades. Cloud computing emerges as a paradigm of Internet computing in which dynamical, scalable and often virtuMized resources are provided as services. With virtualization technology, cloud computing offers diverse services （such as virtual computing, virtual storage, virtual bandwidth, etc.） for the public by means of multi-tenancy mode. Although users are enjoying the capabilities of super-computing and mass storage supplied by cloud computing, cloud security still remains as a hot spot problem, which is in essence the trust management between data owners and storage service providers. In this paper, we propose a data coloring method based on cloud watermarking to recognize and ensure mutual reputations. The experimental results show that the robustness of reverse cloud generator can guarantee users＇ embedded social reputation identifications. Hence, our work provides a reference solution to the critical problem of cloud security.

New mixed broadcast scheduling approach using neural networks and graph coloring in wireless sensor network

Due to the mutual interference and sharing of wireless links in TDMA wireless sensor networks, conflicts will occur when data messages are transmitting between nodes. The broadcast scheduling problem （BSP） is aimed to schedule each node in different slot of fixed length frame at least once, and the objective of BSP is to seek for the optimal feasible solution, which has the shortest length of frame slots, as well as the maximum node transmission. A two-stage mixed algorithm based on a fuzzy Hopfield neural network is proposed to solve this BSP in wireless sensor network. In the first stage, a modified sequential vertex coloring algorithm is adopted to obtain a minimal TDMA frame length. In the second stage, the fuzzy Hopfleld network is utilized to maximize the channel utilization ratio. Experimental results, obtained from the running on three benchmark graphs, show that the algorithm can achieve better performance with shorter frame length and higher channel utilizing ratio than other exiting BSP solutions.

Adjacent vertex-distinguishing total colorings of K_s∨K_t

Let G be a simple graph and f be a proper total kcoloring of G. The color set of each vertex v of G is the set of colors appearing on v and the edges incident to v. The coloring f is said to be an adjacent vertex-distinguishing total coloring if the color sets of any two adjacent vertices are distinct. The minimum k for which such a coloring of G exists is called the adjacent vertex-distinguishing total chromatic number of G. The join graph of two vertex-disjoint graphs is the graph union of these two graphs together with all the edges that connect the vertices of one graph with the vertices of the other. The adjacent vertex-distinguishing total chromatic numbers of the join graphs of an empty graph of order s and a complete graph of order t are determined.

The effects of coloring therapy on patients with generalized anxiety disorder

Generalized anxiety disorder(GAD)has harmful effects on physical and mental health and quality of life.Coloring therapy has been reported to have a positive effect on improving patient anxiety and depression.But there are no reported clinical trials examining their effectiveness as a treatment for GAD.This study was planned to evaluate the effectiveness of coloring therapy combined with conventional therapy in improving anxiety,depression,and positive and negative emotions with GAD.This randomized controlled study comprising 88 GAD patients was selected for intervention in different wards.The control group(n=45)was given conventional antianxiety medication and physical therapy,and the experimental group(n=43)received coloring therapy combined with conventional therapy.The Self-Rating Depression Scale,Self-Rating Anxiety Scale(SAS),Hamilton Depression Scale,Hamilton Anxiety Scale(HAMA),and Positive and Negative Affect Scale were assessed in both groups before and 3 weeks after the intervention.After the intervention,there were statistical differences in intra-and inter-group comparisons of anxiety,depression,and positive and negative mood scales in the experimental and control groups(p<.05).The minus in anxiety/positive emotions pre-and postintervention in the experimental group was statistically significant compared to that in anxiety/positive emotions pre-and postintervention in the control group(HAMA:d=1.45,95%confidence interval[CI](0.34,2.57),p=.011;SAS:d=3.87,95%CI(1.73,6.00),p=.001;positive:d=1.76,95%CI(0.17,3.34),p=.030).The minus in depressive/negative emotions pre-and postintervention in the experimental group was not statistically significant compared with that in depressive/negative emotions pre-and postintervention in the control group(p>.05).For GAD patients,adding coloring therapy based on conventional drug therapy and physical therapy can not only reduce depression and negative emotions but also have better effects on reducing anxiety and improving positive emotions than conventional therapy.