排序方式: 共有16条查询结果,搜索用时 15 毫秒
1.
2.
3.
On the Ascending Subgraph Decompositions Problem 总被引:1,自引:0,他引:1
Inthispaper,weconsideronlysimpleundirectedgraphsandfollowBondyandMurtyl7]forterminologyandnotationnotdefinedhere.Y.Alaviandothershavegiventhedefinitionoftheascendingsubgraphdecomposionin[1].LetGbeagraphofqedgessatisfy(" 1)5q<(" ,).ThenGissaidtohavean... 相似文献
4.
5.
6.
1.IntroductionIn[1],Alavietal.gavethefollowingdecompositionconjecture.Conjecture.LetGbeagraphwith("1')edges.ThentheedgesetofGcanbedecomposedintonsetsgeneratinggraphsGI,G2,'IG.suchthatIE(Gi)I=i(fori=1,2,',n)andGiisisomorphictoasubgraphofGi 1fori=1,2,'.)n--1.AgraphGthatcanbedecomposedasdescribedinConjecturewillbesaidtohaveanAscendingSubgraphDecomposition(AlsoabbreviatedasASD).ThesubgraphsGIIG2,',G.aresaidtobemembersofsuchadecomposition.Furthermore,ifeachGiisastar(matching,pat… 相似文献
7.
关于图的升分解的Alavi猜想 总被引:3,自引:1,他引:2
Y.Alavi等人在1987年定义了图的一种新分解,即“升分解”(ascebding subgraph decomposition),并提出猜想:设自然数n≥2,G是由k个分离的星S_1,S_2,…,S_k构成的图,S_i含有a_i条边,n≤a_i≤2n-2,,则G可升分解为星的并。本文证明了当n=2k+i(i=0,1,2)时猜想成立。 相似文献
8.
In 1977, H. Bodendiek, H. Schumach and H. Wegner proposed the following conjecture.Conjecture. The graphs consisting of a cycle plus one edge joining two non-adjacent vertices are graceful.In this paper, we have proved the following result.It is Graceful Graph for any cycle cn to be added one edge joining two non-adjacent vertices so we have Cm′. 相似文献
9.
关于P(n1,n2,...nm)和Dm,4的优美性 总被引:3,自引:0,他引:3
一个简单图G=(V,E)是k-优美的(k≥1的整数),如果存在一个1-1映射 f:V(G)→(0,1,…,|E| k-1)使得对所有的边e=wv∈E(G),由f~*(u,v)=|f(u)-f(v)|导出的映射 E(G)→{k,k 1,…,|E| k-1}是一个1-1对应。这个关于k-优美的概念是由Slater和Thuillier相互独立地提出来的。当k=1,就是我们通常研究的优美图。显然,k-优美图一定是1-优美图。反之不真。例如,三回路c_3是1-优美图,但对k>1,非k-优美。 相似文献
10.