【摘 要】
：
A total-k-adjacent vertex distinguishing-coloring of G is a(proper)total-k-coloring of G such that any pair of adjacent vertices have distinct sets of color
【机 构】
：
SchoolofMathematics,ShandongUniversity,Jinan,250100,P.R.China
【出 处】
：
第六届图论与组合算法国际研讨会(The 6th International Symposium on Graph The
论文部分内容阅读
A total-k-adjacent vertex distinguishing-coloring of G is a(proper)total-k-coloring of G such that any pair of adjacent vertices have distinct sets of colors.
其他文献
For any integer m>0 and any real c,let f(m,c)=∑∞k=0(km+1)k-1cke-(km+1)c/k!.The identity f(m,/c=m)m=f(1,c)arises in the random graph theory.Here we present
Let n and k be two positive integers satisfying n≥2k.Let A be an intersecting family of(C)([n]k).
Graphs/digraphs of graph theory are naturally and vividly used to be models for understanding and simulating complex networks nowadays.We talk about some ph
In this talk,we give Brualdi-type eigenvalue inclusion sets of tensors by using associated digraphs of tensors,and discuss some properties of Z-eigenvalues
The arc-chromatic number of a digraph is the smallest number of colors required in an arc-coloring such that no two consecutive arcs get the same color.
Graphs are frequently used by computer scientists as abstractions when modeling an application problem in networks.Cutting a graph into smaller pieces is on
Let G be a graph and id(v) denote the implicit degree of a vertex v in G.An induced subgraph H of G is called f-implicit-heavy if max{id(x),id(y)}≥|V(G)|/2
若G中长为r+tj+i的圈恰好有pi(0≤i≤t-1)个,其中∑t-1i=0pi=t,r+tj+i-1≤n,则称G为r-(p0,…,pt-1)-泛圈图。本文主要采用构造法,给出当t=8时r-(p0,…,pt-1)-泛圈图的一
A mixed hypergraph is a hypergraph containing two families of edges: C-edges and D-edges.In a proper coloring of the vertices,every C-edge must have two ver
The equitable coloring problem,introduced by Meyer in 1973,has received considerable attention and research.Recently,Wu et al.introduced the concept of equi