路的字典积的邻和可区别边染色

图G的正常[k]-边染色σ是指颜色集合为[k]={1,2,…,k}的G的一个正常边染色.用w_σ（x）表示顶点x关联边的颜色之和,即w_σ（x）=∑_e∋x σ（e）,并称w_σ（x）关于σ的权.图G的k-邻和可区别边染色是指相邻顶点具有不同权的正常[k]-边染色,最小的k值称为G的邻和可区别边色数,记为χ'_∑（G）.现得到了路P_n与简单连通图H的字典积P_n[H]的邻和可区别边色数的精确值,其中H分别为正则第一类图、路、完全图的补图.     

关于左手性介质几何光学的研究(一)

根据几何光学中的费马原理和完善成像原理研究了光线经过正负折射率界面时的传播特性,推导了单负折射率完善成像的曲面方程,讨论了单块负折射率透镜成像特性的一些缺陷及改进方案,依此指出了最短时间原理的适用范围的局限性和利用左手性介质制作光学器件的优越性,为进一步研究左手性介质的光学特性和相关光学器件设计提供了理论基础.     

Helicity and other conservation laws in perfect fluid motion

In this review paper, we discuss helicity from a geometrical point of view and see how it applies to the motion of a perfect fluid. We discuss its relation with the Hamiltonian structure, and then its extension to arbitrary space dimensions. We also comment about the existence of additional conservation laws for the Euler equation, and its unlikely integrability in Liouville's sense.     

Partitioning series-parallel multigraphs into ν *-excluding edge covers

We prove that, for any given vertex ν* in a series-parallel graph G, its edge set can be partitioned into κ = min{κ′(G) + 1, δ(G)} subsets such that each subset covers all the vertices of G possibly except for ν*, where δ(G) is the minimum degree of G and κ′(G) is the edge-connectivity of G. In addition, we show that the results in this paper are best possible and a polynomial time algorithm can be obtained for actually finding such a partition by our proof.     

两类积图的邻点可区别全染色

本文.证明了,当n≥2时,Xat(K_n×K′_n)=2n;当p,q≥2时,Xat(C_(2p)×K_(2q))=2q 3,其中K_n×K′_n是两个不同标号完全图的积图,C_(2p)×K_(2q)是偶圈和偶阶完全图的积图.     

An inequality for the group chromatic number of a graph

We give an inequality for the group chromatic number of a graph as an extension of Brooks’ Theorem. Moreover, we obtain a structural theorem for graphs satisfying the equality and discuss applications of the theorem.     

Halin-图的邻强边染色

图G(V,E)的正常κ-边染色f叫做图G(V,E)的κ-邻强边染色当且仅当任意uv∈E(G)满足f[u]≠f[v],其中,f[u]={f(uw)|uw∈E(G)},称f是G的κ-临强边染色,简记为κ-ASEC.并且x′_as(G)=min{k|κ-ASEC of G}叫做G(V,E)的邻强边色数.本文研究了△(G)≥5的Halin-图的邻强边色数.     

图的路色数问题的NP－完全性

一个给定的图是否存在用ｒ种颜色的正常Ｐｋ着色？称该问题为图的（ｋ，ｒ）路色数问题．本文研究其算法复杂性，并得到以下结果：对于任意给定的ｋ，２≤ｋ≤∞，图的（ｋ，２）路色数问题及直径为２的图的（ｋ，３）路色数问题都是ＮＰ－完全的；对于任意给定的ｋ，２≤ｋ≤∞，平面图的（ｋ，３）路色数问题也是ＮＰ－完全的．     

Minimum sum set coloring of trees and line graphs of trees

In this paper, we study the minimum sum set coloring (MSSC) problem which consists in assigning a set of x(v) positive integers to each vertex v of a graph so that the intersection of sets assigned to adjacent vertices is empty and the sum of the assigned set of numbers to each vertex of the graph is minimum. The MSSC problem occurs in two versions: non-preemptive and preemptive. We show that the MSSC problem is strongly NP-hard both in the preemptive case on trees and in the non-preemptive case in line graphs of trees. Finally, we give exact parameterized algorithms for these two versions on trees and line graphs of trees.     

A Totally(Δ+1)-colorable 1-planar Graph with Girth at Least Five

A graph is 1-planar if it can be drawn on the plane so that each edge is crossed by at most one other edge.In this paper,we prove that every 1-planar graph G with maximum degree Δ(G)≥12 and girth at least five is totally(Δ(G)+1)-colorable.