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-dist...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 study of dyeability of the modified flax that uses dye-uptake to reflect its modifying effect is reported in this paper. The optimal technological condition is that the concentration of the modifying agent is 4 g/...The study of dyeability of the modified flax that uses dye-uptake to reflect its modifying effect is reported in this paper. The optimal technological condition is that the concentration of the modifying agent is 4 g/l, and NaOH is 6 g/l at liquor ratio of 1∶30 for 60 min. at 85℃.Dyeability include uptake rate and color fastness. Dye-uptake of the modified flax is twice more than that of the unmodified. And their color fastness doesnt fall and some of them raise 0.51 level.展开更多
基金The Fundamental Research Funds for the Central Universities of China(No.3207013904)
文摘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 study of dyeability of the modified flax that uses dye-uptake to reflect its modifying effect is reported in this paper. The optimal technological condition is that the concentration of the modifying agent is 4 g/l, and NaOH is 6 g/l at liquor ratio of 1∶30 for 60 min. at 85℃.Dyeability include uptake rate and color fastness. Dye-uptake of the modified flax is twice more than that of the unmodified. And their color fastness doesnt fall and some of them raise 0.51 level.
