共查询到17条相似文献,搜索用时 31 毫秒
1.
证明了,若G是一个p-阶3-连通无爪图,p≠10,11,15,并对G中任意两个不相邻的点u和v,满足|N(u)∪N(v)|≥(p-1)/2,则G是泛圈图. 相似文献
2.
Let G be a graph. An independent set Y in G is called an essential independent set (or essential set for simplicity) if there is {Y1, Y2} 包含于Y such that dist (y1,y2)=2. In this paper, we use the technique of the vertex insertion on l-connected (l=k or k 1, k≥2) graphs to provide a unified proof for G to be hamiltonian, or hamiltonian-connected. The sufficient conditions are expressed an inequality on ∑i=1 K|N(Yi)| b|N(y0)| and n(Y) for each essential set Y={y0,y1,…,yk}, where b (1≤b≤k)is an integer,Yi={yi,yi-1,…,yi-(b-1}包含于Y\{y0} for i属于V(G):dist(v,Y)≤2}|. 相似文献
3.
该文利用邻域并条件讨论图的点泛圈性,证明了当min{│N(u)∪N(v)│u,v∈V(G), 相似文献
4.
设G=(V,E)为简单图,δ为图G的最小度,1987年Faudree等人给出NC=min{|N(x)∪N(y)‖x,y∈V(G),xy∈N(G)},有关文献曾研究3连通的H连通图,本文进一步得到:若G是n阶2连通图,且NC≥n-δ,则G除几个图外均是H连通图,从而,完成了邻并条件的H连通图问题。 相似文献
5.
关于图与圈之并图的圈唯一性 总被引:2,自引:0,他引:2
Farrell[1]引进图 G 的圈多项式 c(G;■).文[6]猜测:轮形图 W_8是圈唯一的.本文中我们证明上述猜测为真且讨论了某些图与圈之并图的圈唯一性. 相似文献
6.
7.
9.
10.
记G=(V,E)是简单图,1971年Bondy得到O re条件下的泛圈图的著名结果:若2连通n阶图G的不相邻的任两点x、y均有d(x) d(y)≥n,则G是泛圈图或G=Kn/2,n/2.这里进一步研究条件d(x) d(y)≥n-1,得到:若2连通n阶图G的不相邻的任两点x、y均有d(x) d(y)≥n-1,则G是泛圈图或G∈{K(Cn 1)/2∨G(n-1)/2,Kn/2,n/2}.本文作者得知最近国际著名权威专家Ho lton等人也得到完全相同的结果,但本证明更简捷. 相似文献
11.
F. Havet 《Journal of Graph Theory》2004,47(2):87-110
A tournament is an orientation of the edges of a complete graph. An arc is pancyclic in a tournament T if it is contained in a cycle of length l, for every 3 ≤ l ≤ |T|. Let p(T) denote the number of pancyclic arcs in a tournament T. In 4 , Moon showed that for every non‐trivial strong tournament T, p(T) ≥ 3. Actually, he proved a somewhat stronger result: for any non‐trivial strong tournament h(T) ≥ 3 where h(T) is the maximum number of pancyclic arcs contained in the same hamiltonian cycle of T. Moreover, Moon characterized the tournaments with h(T) = 3. All these tournaments are not 2‐strong. In this paper, we investigate relationship between the functions p(T) and h(T) and the connectivity of the tournament T. Let pk(n) := min {p(T), T k‐strong tournament of order n} and hk(n) := min{h(T), T k‐strong tournament of order n}. We conjecture that (for k ≥ 2) there exists a constant αk> 0 such that pk(n) ≥ αkn and hk(n) ≥ 2k+1. In this paper, we establish the later conjecture when k = 2. We then characterized the tournaments with h(T) = 4 and those with p(T) = 4. We also prove that for k ≥ 2, pk(n) ≥ 2k+3. At last, we characterize the tournaments having exactly five pancyclic arcs. © 2004 Wiley Periodicals, Inc. J Graph Theory 47: 87–110, 2004 相似文献
13.
图G称为弱泛圈图是指G包含了每个长为t(g(V)≤l≤c(G))的圈,其中g(G),c(v)分别是G的围长与周长.1997年Brandt提出以下猜想:边数大于[n2/4]-n 5的n阶非二部图为弱泛圈图.1999年Bollobas和Thomason证明了边数不小于[n2/4]-n 59的n阶非二部图为弱泛圈图.作者证明了如下结论:设G是n阶Hamilton非二部图,若G的边数不小于[n2/4]-n 12,则G为弱泛圈图. 相似文献
14.
卜月华 《数学的实践与认识》2009,39(4)
唯一泛圈有向图D是一个定向图,对每一个n,3≤n≤υ,D中有且只有一个长为n的有向圈.用g(υ)表示具有υ个顶点的唯一泛圈有向图最小可能的弧数,用N(υ)表示具有υ个顶点、g(υ)条弧且互不同构的唯一泛圈有向图的个数.确定了当υ=3,4,5,6,7,8时的N(υ). 相似文献
15.
16.
Omar De la Cruz Eric J. Hall Paul Howard Kyriakos Keremedis Jean E. Rubin 《Mathematical Logic Quarterly》2008,54(6):652-665
We study statements about countable and well‐ordered unions and their relation to each other and to countable and well‐ordered forms of the axiom of choice. Using WO as an abbreviation for “well‐orderable”, here are two typical results: The assertion that every WO family of countable sets has a WO union does not imply that every countable family of WO sets has a WO union; the axiom of choice for WO families of WO sets does not imply that the countable union of countable sets is WO. (© 2008 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim) 相似文献
17.
Itisknowntoallthatthetheoryofthepoint-countablecoversbeoneofthemostimpor-tantsubjectsinGeneralTopology.Thepoint-countablecoverswithvariouscharacterhavebeendiscussedbymanytopologists,suchasLinandTanaka’spaper[1]onpoint-countableK-network.Inthispaper,w… 相似文献