1) general Mycielski graphs
广义Mycielski图
1.
On the adjacent vertex-distinguishing incidence coloring of general Mycielski graphs;
关于图的广义Mycielski图的邻点可区别关联着色
2.
Adjacent vertex distinguishing total coloring of path's general Mycielski graphs
路的广义Mycielski图的邻点可区别的全染色
3.
Let G be a simple graph,M_n(G) is called a general Mycielski graphs of G if V(M_n(G))=｛v_(01),v_(02),…,v_(0p);v_(11),v_(12),…,v_(1p);…;v_(n1),v_(n2),…,v_(np)｝;and E(M_n(G))=E(G)Y｛v_(ij)v_((i+1)k)|v_(0j)v_(0k)∈E(G),1≤i,j≤p,i=0,1,…,n-1｝,where V(G)=｛v_(0i)|i=1,2,…,p｝.
设G是简单图,V(Mn(G))={v01,v02,…,v0p;v11,v12,…,v1p;…;vn1,vn2,…,vnp};E(Mn(G))=E(G)∪{vijv(i+1)k|v0jv0k∈E(G),1≤i,j≤p,i=0,1,…,n-1},则Mn(G)称为G的广义Mycielski图,其中,V(G)={v0i|i=1,2,…,p}。
2) general Mycielski graph
广义Mycielski图
1.
In this paper,the vertex-edge adjacent vertex-distinguishing total chromatic number of the general Mycielski graph of some spacial .
本文讨论了星,扇,轮,圈等图的广义Mycielski图的点边邻点可区别全染色,得到了它们的点边邻点可区别全色数,其中每个点的色集合包含该点及其关联边的颜色。
2.
This paper focuses on the relation between the basic graph G and it\'s general Mycielski graph,two bounds of adjacent strong edge chromatic number and adjacent vertex distinguishing total chromatic nubmer of graph Mn(G) are given.
对简单图G,|V(G)|=p,n是自然数,Mn(G)被称为图G的广义Mycielski图,如果V(Mn(G))={v01,v02,…,v0p;v11,v12,…,v1p;…;vn1,vn2,…,vnp},E(Mn(G))=E(G)∪{vijv(i+1)k|v0jv0k∈E(G),1≤j,k≤p,i=0,1,…,n-1}。
3) generalized Mycielski's graph
推广Mycielski图
4) Mycirelski graph
Mycielski图
1.
It is μ(G) called Mycrelski Graph G,V(μ(G))=V(G)∪V′∪｛w｝and wV(G) and E(μ(G))=E(G)∪｛uv′｜u∈V(G),v′∈V′,uv∈E(G)｝∪｛wv′｜v′∈V′｝ where wV(G),V′=｛v′｜v∈V(G)｝ In this paper,we can see that the total chromatic number of Mycirelski graph of some graphs such as path,cycle,fan,wheel,star, complete graph and etc.
对图G(V ,E) ,μ(G)称为G的Mycielski图 ,V( μ(G) ) =V(G)∪ {v′｜v∈V(G) }∪ {w} E( μ(G) ) =E(G)∪ {uv′｜u∈V(G) ,v′∈V′且uv∈E(G) }∪ {wv′｜v′∈V′}其中w V(G) ,V′={v′｜v∈V(G) } 。
5) Mycielskian graph
Mycielski图
1.
In this paper ,we studied edge chromatic number of Mycielskian graph.
对图G(V,E),μ(G)称为G的Mycielski图,V(μ(G))=V(G)∪{v′｜v∈V(G)}∪{w},且w V(G),而E(μ(G))=E(G)∪{uv′｜u∈V(G),v′∈V′,且uv∈E(G)}∪{wv′｜v′∈V′},其中w V(G),V′={v′｜v∈V(G)}。
6) Mycielski Graph
Mycielski图
1.
Equitable Total Chromatic Number of Mycielski Graphs of Two Classes of Graphs;
两类图的Mycielski图的均匀全色数
2.
For given graph G=(V,E),the Mycielski graph of G,denoted by μ(G),is the graph with V(μ(G))=V∪V ∪{w} and E(μ(G))=E∪{xy |xy∈E}∪{wy |y ∈V } where V ={y |y∈V},For each y∈V(G),y is called to be the copied vertex of y.
给定图G=(V,E),G的Mycielski图μ(G)被定义为一个新图:V(μ(G))=V∪V'∪{w},其中V'={y'｜y∈V};E(μ(G))=E∪{xy'｜xy∈E}∪{wy'｜y'∈V'},称点y'为y的复制点。
3.
In this paper,based on introducing a special kind of partition of the vertex set of Mycielski graphs and some new concepts,the characters of the circular coloring of Mycielski graphs are analyzed.
通过引入一类点集划分的概念,研究了Mylielski图循环染色的性质,证明了当完全图的点数足够大时,它的Mycielski图的循环色数与其点色数相等。
补充资料：图的减缩图(或称图子式)
图的减缩图(或称图子式)
minor of a graph
图的减缩图(或称图子式)【.皿以ofa脚户;MHHoPrpa中a」【补注】设G是一个图(graph)(可以有环及多重边).G的一个减缩图(nullor)是从G中接连进行下述运算而得的任何一个图: i)删去一条边; 五)收缩一条边; 说)去掉一个孤立顶点. NRobe由on与P.D.Se脚aour的图减缩定理(脚Ph nl的。r theon习11)如下所述:已知有限图的无穷序列G，，GZ，…，则存在指标i
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条