Quark-Antiquark and Diquark Condensates in Vacuum in Two-Flavor Four-Fermion Interaction Models with Any Color Number N_c

The color number Nc-dependence of the interplay between quark-antiquark condensates （q^-q） and diquark condensates （qq） in vacuum in two-flavor four-fermion interaction models is researched. The results show that the Gs-Hs （the coupling constant of scalar （q^-q）2-scalar （qq）2 channel） phase diagrams will be qualitatively consistent with the case of Nc = 3 as Nc varies in 4D Nambu-Jona-Lasinio model and 219 Gross Neveu （GN） model, However, in 3D GN model, the behavior of the Gs-Hp （the coupling constant of pseudoscalar （qq）^2 channel） phase diagram will obviously depend on No. The known characteristic that a 3D GN model does not have the coexistence phase of the condensates （q^-q） and （qq） is proven to appear only in the case of Nc ≤ 4. In all the models, the regions occupied by the phases containing the diquark condensates （qq） in corresponding phase diagrams will gradually decrease as Nc grows up and finally go to zero if Nc → ∞, i.e. in this limit only the pure （q^-q） phase could exist.

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].

Method for determining number of coherent signals in the presence of colored noise

The approach of estimating the number of signals based on information theoretic criteria has good performance in the assumption of white noise, but it always leads to false estimation of the coherent sources in colored noise. An approach combining the combined information theoretic criteria and eigen- value correction, is presented to determine number of signals. The method uses maximum likelihood （ML） and information theoretic criteria to estimate coherent signals alternately, then eliminate the inequality of the eigenvalues caused by colored noise by correcting the noise eigenvalues. The computer simulation results prove the effective performance of the method.

Colored-Motzkin数对数凸性研究

通过构造Colored-Motzkin三角矩阵,验证了该矩阵为Aigner-Catalan-Riordan矩阵的特例。通过证明Colored-Motzkin数是Colored-Motzkin三角矩阵的第0列元素来研究其对数凸性。由于Catalan数、Motzkin数、Hexagonal数都是Colored-Motzkin数的特例,因此可以统一的推导出Catalan数、Motzkin数、Hexagonal数各自都构成对数凸序列。

与正整数n-color有序分拆相关的一些恒等式

首先给出了正整数自反的n-color有序分拆数与Fibonacci数、Lucas数之间的几个关系式.然后利用其中的一个关系式给出了正整数ν的右端分部量不等于11的n-color有序分拆数与正整数的分部量是1、2的有序分拆数、分部量是奇数的有序分拆数、分部量大于1的有序分拆数之间的一些恒等式,并给出了组合证明.

关于两类color有序分拆的一个恒等式

考虑了正整数n的有序分拆中,分部量1有两种形式的情形,发现正整数n的分部量1有两种形式的有序分拆数等于第2n+1个Fiboacci数F2n+1.进一步得到了一个涉及正整数n的分部量1有两种形式的有序分拆数与正整数的n-color有序分拆数之间的一个恒等式.并且给出了正整数n的分部量1有两种形式的有序分拆数的一个显式计数公式.

A SEVEN-COLOR THEOREM ON EDGE-FACE COLORING OF PLANE GRAPHS

Melnikov(1975) conjectured that the edges and faces of a plane graph G can be colored with △(G) + 3 colors so that any two adjacent or incident elements receive distinct colors, where △(G) denotes the maximum degree of G. This paper proves the conjecture for the case △(G) ≤4.

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.

On a Sufficient and Necessary Condition for Graph Coloring

Using the linear space over the binary field that related to a graph G, a sufficient and necessary condition for the chromatic number of G is obtained.

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 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.

List Extremal Number of Union of Short Cycles

The list extremal number f（G） is defined for a graph G as the smallest integer k such that the join of G with a stable set of size k is not ｜V（G）｜-choosable. In this paper, we find the exact value of f（G）, where G is the union of edge-disjoint cycles of length three, four, five and six. Our results confirm two conjectures posed by S. Gravier, F. Maffray and B. Mohar.

Proofs for some known results of equitable coloring

A graph is equitably k-colorable if its vertices can be partitioned into k independent sets of as near equal sizes as possible.In this paper,we give new methods to prove some known results of equitable coloring of complete r-partite Graphs.

Further Results on Acyclic Chromatic Number

An acyclic coloring of a graph is a proper vertex coloring such that the union of any two color classes induces a disjoint collection of trees.The purpose of this paper is to derive exact values of acyclic chromatic number of some graphs.

Adjacent Vertex-distinguishing E-total Coloring on Some Join Graphs Cm V Gn

Let G(V, E) be a simple connected graph and k be positive integers. A mapping f from V∪E to {1, 2, ··· , k} is called an adjacent vertex-distinguishing E-total coloring of G(abbreviated to k-AVDETC), if for uv ∈ E(G), we have f(u) ≠ f(v), f(u) ≠ f(uv), f(v) ≠ f(uv), C(u) ≠C(v), where C(u) = {f(u)}∪{f(uv)|uv ∈ E(G)}. The least number of k colors required for which G admits a k-coloring is called the adjacent vertex-distinguishing E-total chromatic number of G is denoted by x^e_(at) (G). In this paper, the adjacent vertexdistinguishing E-total colorings of some join graphs C_m∨G_n are obtained, where G_n is one of a star S_n , a fan F_n , a wheel W_n and a complete graph K_n . As a consequence, the adjacent vertex-distinguishing E-total chromatic numbers of C_m∨G_n are confirmed.

The Equitable Total Chromatic Number of Some Join graphs

A proper total-coloring of graph G is said to be?equitable if the number of elements (vertices and edges) in any?two color classes differ by at most one, which the required?minimum number of colors is called the equitable total chromatic?number. In this paper, we prove some theorems on equitable?total coloring and derive the equitable total chromatic numbers?of Pm V?Sn, Pm V?Fn and Pm V Wn.

Algorithm on the Optimal Vertex-Distinguishing Total Coloring of mC9

Let G be a simple graph and f be a proper total coloring(or a total coloring in brief) of G. For any vertex u in G, Cf(u) denote the set of colors of vertex u and edges which incident with vertex u. Cf(u) is said to be the color set of vertex u under f. If Cf(u) = Cf(v)for any two distinct vertices u and v of G, then f is called vertex-distinguishing total coloring of G(in brief VDTC), a vertex distinguishing total coloring using k colors is called k-vertexdistinguishing total coloring of G(in brief k-VDTC). The minimum number k for which there exists a k-vertex-distinguishing total coloring of G is called the vertex-distinguishing total chromatic number of G, denoted by χvt(G). By the method of prior distributing the color sets, we obtain vertex-distinguishing total chromatic number of m C9 in this paper.

Uniquely Tree Colorable Graphs

In this paper, the concepts of tree chromatic numbers and uniquely tree colorable graphs are introduced. After discussion some fundamental properties, three necessary conditions for a simple graph to be uniquely tree colorable are given. Moreover, a series of uniquely tree colorable graphs are constructed.

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.

Rainbow Vertex-connection Number of Ladder and Mbius Ladder

A vertex-colored graph G is said to be rainbow vertex-connected if every two vertices of G are connected by a path whose internal vertices have distinct colors, such a path is called a rainbow path. The rainbow vertex-connection number of a connected graph G, denoted by rvc(G), is the smallest number of colors that are needed in order to make G rainbow vertex-connected. If for every pair u, v of distinct vertices, G contains a rainbow u-v geodesic, then G is strong rainbow vertex-connected. The minimum number k for which there exists a k-vertex-coloring of G that results in a strongly rainbow vertex-connected graph is called the strong rainbow vertex-connection number of G, denoted by srvc(G). Observe that rvc(G) ≤ srvc(G) for any nontrivial connected graph G. In this paper, for a Ladder L_n,we determine the exact value of srvc(L_n) for n even. For n odd, upper and lower bounds of srvc(L_n) are obtained. We also give upper and lower bounds of the(strong) rainbow vertex-connection number of Mbius Ladder.