共查询到20条相似文献,搜索用时 78 毫秒
1.
设G是一个图 ,G的独立集Y称为本质集 ,如果存在 {y1,y2 } Y ,使得dist(y1,y2 ) =2 .本文利用插点方法 ,给出了关于k或 (k + 1)连通 (k≥ 2 )无爪图G是哈密尔顿的或 1哈密尔顿的统一的证明 .2个结果的充分条件是关于 ∑ki=0N(Yi) 与n(Y)的不等式 ,这里Y是图G的任一本质集 ,对于i∈ { 0 ,1,… ,k} ,Yi={y1,yi- 1,… ,yi- (b- 1) } Y(yj 的下标将取模k + 1) ;b是一个整数 ,且 0 相似文献
2.
对简单图G(V.E),f是从E(G)到{1,2,…,k}(k是自然数)的映射,若f满足:(1)()uv,uw∈E(G),v≠w,f(uv)≠f(uww);(2)()uv∈E(G).|C(u)\C(v)|≥1,并且|C(v)\C(u)|≥1;则称f是G的Smarandachely邻点边染色.文章给出了m(m=2,3,4)阶路与n阶路的联图的smarandachely邻点边色数.其中C(u)={f(uv)|uv∈E(G)且u≠v}. 相似文献
3.
林晶 《福建工程学院学报》2013,11(4):307-311
对于直积图G=C m□C n,f∶V(G)→Z2={0,1}是任意一个定义在顶点集上的二元映射,定义V0=f-1(0),V1=f-1(1)。若|V1|-|V0|≤1,则称映射f是平衡的。f可以自然诱导出一个定义在边集E(G)上的二元映射f E∶E(G)→Z2,且f E(xy)=f(x)+f(y)。令E0=f-1E(0),E1=f-1E(1),那么D(G,f)=|E1(f)|-|E0(f)|。文章通过在两个圈的直积图C m□C n上构造一系列平衡二元映射的方法,完全确定了在平衡映射下的边差集D(Cm□Cn)。 相似文献
4.
两个图G1和G2的笛卡尔积图G1×G2定义为如下的图:V(G1×G2)=V(G1)×V(G2),E(G1×G2)={(u1,u2)(v1,v2)|u1=v1且u2v2∈E(G2),或者u2=v2且u1v1∈E(G1).图的交叉数是图论中的一个重要拓扑参数,而确定图的交叉数是一个完全NP-问题.本文确定了若干树Tn(n≤4)与圈Cm的笛卡尔积图的交叉数. 相似文献
5.
6.
两个图G1和G2的笛卡尔积图G1×G2定义为如下的图:V(G1×G2)=V(G1)×V(G2),E(G1×G2)={(u1,u2)(v1,v2)|u1=v1且u2v2∈E(G2),或者u2=v2且u1v1∈E(G1)}.图的交叉数是图论中的一个重要拓扑参数,而确定图的交叉数是一个完全胛一问题.本文确定了若干树Tn(n≤4)与圈Cm的笛卡尔积图的交叉数. 相似文献
7.
刘春峰 《湖南城市学院学报》1992,(6)
设G是一个简单图,e=uv∈E(G),定义e的度d(e)=d(u)+d(v),其中d(u)和d(v)分别为顶点u和v的度。本文的主要结果是:设G是n≥3所无桥的简单连通图,且G不含C_3和C_4,若对任何三个相互不交的边e_0,e_1及e_2,d(e_0)+d(e_1)+d(e_1)≥n+7,则G有一个S—闭迹。 相似文献
8.
9.
10.
图G=(V,E)的k-赋权w是对图的每条边e∈E安排一个权值w(e)∈{1,2,…,k}.由边权导出图G的一个乘积顶点染色c,使得对图的每一个顶点v,c(v)=∏v∈e w(e)且对任意的边e=uv∈E,都有c(u)≠c(v).本文研究了Kn-e,Pm×Pn(m,n≥2)和Pm×Cn(m≥2)2-赋权乘积顶点染色的存在性. 相似文献
11.
如果G表示一个四角系统,则G的Z-变换图Z(G)指如下定义的图:图Z(G)的所有顶点对应于四角系统G中的所有完美匹配,且Z(G)中的两个顶点有一条边相连当且仅当它们在G中对应的两个完美匹配的对称差恰好形成G的一个四角形.利用图同构的方法,证明了两类四角系统(L-四角系统和Z-四角系统)的Z-变换图必含有一条Hamilton路. 相似文献
12.
The problem of monitoring an electric power system by placing as few measurement devices in the system as possible is closely related to the well-known vertex covering and dominating set problems in graph theory. In this paper, it was shown that the power domination number of an outerplanar graph with the diameter two or a 2-connected outerplanar graph with the diameter three is precisely one. Upper bounds on the power domination number for a general planar graph with the diameter two or three were determined as an immediate consequences of results proven by Dorfling, et al. Also, an infinite family of outerplanar graphs with the diameter four having arbitrarily large power domination numbers were given. 相似文献
13.
Let G=(V, E)be a simple graph without isolated vertices. For positive integer κ, a 3-valued function f:V → {-1, 0, 1} is said to be a minus total k-subdominating function(MTκSF)if ∑u∈N(u)f(u)≥ 1 for at least κ vertices v in G, where N(v)is the open neighborhood of v. The minus total κ-subdomination number γ-κt(G)equals the minimum weight of an MTkSF on G. In this paper, the values on the minus total κ-subdomination number of some special graphs are investigated. Several lower bounds on γ-κt of general graphs and trees are obtained. 相似文献
14.
How do university students understand the graphs that they read in their textbooks? How does their knowledge regarding the content and their statistical training influence this understanding? Does the kind of task demand also influence this understanding? To answer these questions, we asked a group of psychology students and a group of economics students to choose the most suitable graph for presenting the results of different psychological research studies (reports) (selection task) or to explain in words the results of the same reports shown by means of their graphic representations only (interpretation task). The results showed there were very few differences between groups. Most of the students were able to relate textual information to the adequate graph, but also revealed significant shortcomings and mistakes in their understanding of important syntactic aspects of graphs. They also interpreted the graphs correctly but their interpretation had different levels of complexity, which were not always optimal. We also identified significant differences regarding the difficulty of the reports and the kinds of misinterpretations of graphs. The two tasks thus revealed different pictures of students’ skills in reading and interpreting graphs and, consequently, how the characteristics of task demands influence their performance. 相似文献
15.
林启法 《宁德师专学报(自然科学版)》2010,22(3):233-234,242
Hamilton图是图论中重要的一类特殊图.主要证明了两个图的联图是Hamilton图,从而进一步证明了n个图的联图也是Hamilton图. 相似文献
16.
马宝林 《河南职业技术师范学院学报》2011,(5):44-46,50
根据图的点可区别全染色的概念及其染色方法,讨论了图的点可区别V-全染色,给出了完全图Kn的点可区别V-全色数的结论及其证明,为进一步探讨其他简单图的点可区别V-全染色提供了理论证据,丰富了图的点可区别V-全染色的结果. 相似文献
17.
18.
李秀焰 《宁德师专学报(自然科学版)》2010,22(1):106-108,112
概念图是显示概念之间的意义联系的空间网络结构图.生物教学中深化概念图教学可使学生获得充分的感知信息,产生意义建构,使知识脉络更加清晰,从而促进和优化学习效果. 相似文献
19.
某些整数距离图的染色 总被引:1,自引:0,他引:1
整数距离图是这样一类图G(Z,D),其中,V(G)=Z,两点u,v之间存在一条边,当且仅当|u-v|∈D,这里D是由自然数组成的一个集合.利用组合数学中的一个相关定理和距离图染色中我们已知的一些结论,通过几种周期染色组合的方法,本确定了|D|=4且D中包含{2,3}和|D|=5且包含{2,3,5}时某些距离图G(Z,D)的点色数x(D). 相似文献
20.