共查询到20条相似文献,搜索用时 46 毫秒
1.
2.
《数学季刊》2016,(2):147-154
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) 6= 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 χievt(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 K8,n are discussed in this paper. Particularly, the VDIET chromatic number of K8,n are obtained. 相似文献
3.
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 χ ie vt (G),and it is called the VDIET chromatic number of G.We will give VDIET chromatic numbers for complete bipartite graph K4,n (n≥4),K n,n (5≤ n ≤ 21) in this article. 相似文献
4.
5.
6.
王国兴 《数学的实践与认识》2012,42(6):233-236
设G是简单图,图G的一个k-点可区别Ⅵ-全染色(简记为k-VDIVT染色),f是指一个从V(G)∪E(G)到{1,2,…,k}的映射,满足:()uv,uw∈E(G),v≠w,有,f(uv)≠f(uw);()u,V∈V(G),u≠v,有C(u)≠C(v),其中C(u)={f(u)}∪{f(uv)|uv∈E(G)}.数min{k|G有一个k-VDIVT染色}称为图G的点可区别Ⅵ-全色数,记为x_(vt)~(iv)(G).讨论了完全图K_n及完全二部图K_(m,n)的VDIVT色数. 相似文献
7.
8.
9.
设G(V,E)是简单连通图,T(G)为图G的所有顶点和边构成的集合,并设C是k-色集(k是正整数),若T(G)到C的映射f满足:对任意uv∈E(G),有f(u)≠f(v),f(u)≠f(uv),f(v)≠f(uv),并且C(u)≠C(v),其中C(u)={f(u)}∪{f(uv)|uv∈E(G)}.那么称f为图G的邻点可区别E-全染色(简记为k-AVDETC),并称χ_(at)~e(G)=min{k|图G有k-邻点可区别E-全染色}为G的邻点可区别E-全色数.图G的中间图M(G)就是在G的每一个边上插入一个新的顶点,再把G上相邻边上的新的顶点相联得到的.探讨了路、圈、扇、星及轮的中间图的邻点可区别E-全染色,并给出了这些中间图的邻点可区别E-全色数. 相似文献
10.
令G是一个阶为n且最小度为δ的连通图. 当δ很小而n很大时, 现有的依据于最小度参数的彩虹边连通数和彩虹点连通数的上界都很大, 它们是n的线性函数. 本文中, 我们用另一种参数,即k个独立点的最小度和σk来代替δ, 从而在很大程度上改进了彩虹边连通数和彩虹点连通数的上界. 本文证明了如果G有k个独立点, 那么rc(GG)≤3kn/(σk+k)+6k-3. 同时也证明了下面的结果, 如果σk≤7k或σk≥8k, 那么rvc(G)≤(4k+2k2)n/(σk+k)+5k; 如果7k<σk<8k, 那么rvc(G)≤(38k/9+2k2)n/(σk+k)+5k.文中也给出了例子说明我们的界比现有的界更好, 即我们的界为rc(G)≤9k-3和rvc(G)≤9k+2k2或rvc(G)≤83k/9+2k2, 这意味着当δ很小而σk很大时, 我们的界是一个常数, 而现有的界却是n的线性函数. 相似文献
11.
Periodica Mathematica Hungarica - For a given integer $$k\ge 1$$ , a graph G with at least 2k vertices is called k-path-pairable, if for any set of k disjoint pairs of vertices, $$s_i,t_i$$ ,... 相似文献
12.
13.
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. 相似文献
14.
一个关于图是分数(k,n)-临界的邻域并条件 总被引:1,自引:0,他引:1
设G是一个图,以及k是满足1≤k的整数.一个图G在删除任意n个顶点后的子图均含有分数k-因子,则称G是一个分数(k,n)-临界图.给出了图是一个分数(k,n)-临界图的一个邻域并条件,并且该条件是最佳的. 相似文献
15.
16.
Let G be a nontrivial connected and vertex-colored graph. A subset X of the vertex set of G is called rainbow if any two vertices in X have distinct colors. The graph G is called rainbow vertex-disconnected if for any two vertices x and y of G, there exists a vertex subset S of G such that when x and y are nonadjacent, S is rainbow and x and y belong to different components of G-S; whereas when x and y are adjacent, S + x or S + y is rainbow and x and y belong to different components of(G-xy)-S. For a connected graph G, the rainbow vertex-disconnection number of G, denoted by rvd(G), is the minimum number of colors that are needed to make G rainbow vertexdisconnected. In this paper, we characterize all graphs of order n with rainbow vertex-disconnection number k for k ∈ {1, 2, n}, and determine the rainbow vertex-disconnection numbers of some special graphs. Moreover, we study the extremal problems on the number of edges of a connected graph G with order n and rvd(G) = k for given integers k and n with 1 ≤ k ≤ n. 相似文献
17.
3-γ-临界图G中关于i(G)=γ(G)的一个充分条件 总被引:1,自引:0,他引:1
如果图G满足γ(G)=k且对图G中任两个相邻的点x,y有γ(G+xy)=k-1,则称图G为k-γ-临界图,如果图G满足γ(G)=k且对图G中任何距离为d的两点x,y有γ(G+xy)=k-1,则称图G为k-(γ,d)-临界图。Sumner和Blitch猜想在3-γ-临界图中有γ(G)=i(G).Oellermann和Swart猜想3-(γ,2)-临界图中有γ(G)=i(G),这篇文章中我们提出3-γ-临界图中使γ(G)=i(G)的一个充分条件。 相似文献
18.
XuJunming XuKeli 《高校应用数学学报(英文版)》2001,16(3):231-236
Abstract. Let G be a k-connected simple graph with order n. The k-diameter, combining con-nectivity with diameter, of G is the minimum integer 相似文献
19.
分数k-因子临界图的条件 总被引:1,自引:0,他引:1
设G是-个连通简单无向图,如果删去G的任意k个项点后的图有分数完美匹配,则称G是分数k-因子临界图.给出了G是分数k-因子临界图的韧度充分条件与度和充分条件,这些条件中的界是可达的,并给出G是分数k-因子临界图的一个关于分数匹配数的充分必要条件. 相似文献
20.
得到了对于二部图G=(V_1,V_2;E),当|V_1|=|V_2|=n≥2k+1时的结果:对G中任意2k条独立边e_1,e_1~*,…,e_k,e_k~*,G中一定存在k个独立的4-圈C_1,C_2,…,C_k,使得对任意i∈{1,2,…,k}有{e_i,e_i~*}E(C_i).并在此基础上进一步证明了当|V_1|=|V_2|=n≥3k时若对任意两顶点x∈V_1,y∈V_2,都有d(x)+d(y)≥2n-k+1成立,则G有一个2-因子含有k+1个独立圈C_1,C_2,…,C_(k+1)使得对任意i∈{1,2,…,k}有{e_i,e_i~*}E(C_i)且|C_i|=4. 相似文献