...
首页> 外文期刊>Discussiones Mathematicae Graph Theory >γ-Cycles In Arc-Colored Digraphs
【24h】

γ-Cycles In Arc-Colored Digraphs

机译:弧形数字中的γ-循环

获取原文
   

获取外文期刊封面封底 >>

       

摘要

We call a digraph D an m -colored digraph if the arcs of D are colored with m colors. A directed path (or a directed cycle) is called monochromatic if all of its arcs are colored alike. A subdigraph H in D is called rainbow if all of its arcs have different colors. A set N ? V ( D ) is said to be a kernel by monochromatic paths of D if it satisfies the two following conditions:for every pair of different vertices u, v ∈ N there is no monochromatic path in D between them, andfor every vertex x ∈ V ( D ) ? N there is a vertex y ∈ N such that there is an xy -monochromatic path in D .A γ -cycle in D is a sequence of different vertices γ = ( u _(0), u _(1), . . , u_(n), u _(0)) such that for every i ∈ {0, 1, . . , n }:there is a u_(i)u _(i+1)-monochromatic path, andthere is no u _( i +1) u_(i) -monochromatic path.The addition over the indices of the vertices of γ is taken modulo ( n + 1). If D is an m -colored digraph, then the closure of D , denoted by ?( D ), is the m -colored multidigraph defined as follows: V (? ( D )) = V ( D ), A (? ( D )) = A ( D ) ∪ {( u, v ) with color i | there exists a uv -monochromatic path colored i contained in D }.In this work, we prove the following result. Let D be a finite m -colored digraph which satisfies that there is a partition C = C _(1) ∪ C _(2) of the set of colors of D such that: D [?_( i )] (the subdigraph spanned by the arcs with colors in C_(i) ) contains no γ -cycles for i ∈ {1, 2};If ? ( D ) contains a rainbow C _(3) = ( x _(0), z, w, x _(0)) involving colors of C _(1) and C _(2), then ( x _(0), w ) ∈ A (? ( D )) or ( z, x _(0)) ∈ A (? ( D ));If ? ( D ) contains a rainbow P _(3) = ( u, z, w, x _(0)) involving colors of C _(1) and C _(2), then at least one of the following pairs of vertices is an arc in ? ( D ): ( u, w ), ( w, u ), ( x _(0), u ), ( u, x _(0)), ( x _(0), w ), ( z, u ), ( z, x _(0)).Then D has a kernel by monochromatic paths.This theorem can be applied to all those digraphs that contain no γ- cycles. Generalizations of many previous results are obtained as a direct consequence of this theorem.
机译:如果D的弧度用M颜色彩色,我们会呼唤着一个m型颜色的数字。如果所有弧形都是有色的,则指向路径(或定向周期)称为单色。如果所有弧形具有不同的颜色,则D中的一个子层是彩虹。一套n? v(d)通过单色路径是D,如果它满足以下两个条件:对于每对不同顶点u,它们之间没有单色路径,并且每个顶点x∈V都没有单色路径。 (d)? n有一个顶点y∈n,使得在d中有一个xy-monochromatic路径在d中的d。γ-cycle中是一种不同顶点γ=(u _(0),u _(1),。。, U_(n),u _(0)),使得每个I∈{0,1,。 。 ,n}:有一个U_(i)u _(i + 1)-monochromatic路径,zhere是no u _(i +1)u_(i)-monochromatic路径。添加γ顶点的指数上的添加是模数(n + 1)。如果D是M-色彩的数字,那么由?(d)表示的d闭合,是M -Colored MultidigaWaW,如下所示:V(?(d))= v(d),a(d) ))= a(d)∪{(u,v)颜色i |存在I中包含的UV-MOMOOMOMOM路径。在这项工作中,我们证明了以下结果。让D是一个有限的M -Colored Digraph,它满足了D的颜色集的分区C = C _(1)∪C_(2),使得:d [_(i)](子地形由C_(i)中的颜色的弧线跨越弧形)不包含i∈{1,2}的γ-fycles;如果? (d)包含彩虹c_(3)=(x _(0),z,w,x _(0)),涉及C _(1)和C _(2)的颜色,然后(x_(0 ),w)∈a(α(d))或(z,x _(0))∈a(?(d));如果? (d)包含彩虹P _(3)=(u,z,w,x _(0)),涉及C _(1)和C _(2)的颜色,然后是以下至少一个顶点是一个弧吗? (d):( u,w),(w,u),(x _(0),u),(u,x _(0)),(x _(0),w),(z,u ),(z,x _(0))。然后d通过单色路径具有核。本定理可以应用于含有γ-循环的所有数字。获得许多以前结果的概括是作为本定理的直接后果获得的。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号