共查询到20条相似文献,搜索用时 62 毫秒
1.
关于Abel群上Cayley图的Hamilton圈分解 总被引:3,自引:0,他引:3
设G(F,T∩T^-1)是有限Abel群F上的Cayley图,T∩T^-1只含2阶元,此文证明了当T是F的极小生成元集时,若d(G)=2k,则G是k个边不相交的Hamilton圈的并,若d(G)=2k+1,则G是k个边不相交的Hamilton圈与一个1-因子的并。 相似文献
2.
设G是无爪图.对x∈V(G),若G[N(x)]不连通,则存在yi∈V(G)-{x}(i-1,2),使|N(yi)∩Ki(x)|≥2,且|N(yi)∩N(Ki+1(x)){x}|≥2(i模2),那么称无爪图G是强2-阶邻域连通的,其中K1(x),K2(x)分别表示G[N(x)]的两个分支.本文证明了:连通且强2-阶邻域连通的无爪图是Hamilton图. 相似文献
3.
王殿军 《高校应用数学学报(A辑)》1993,(4):425-429
本文给出完全图圈分解的一种新方法,设Kn(n≥3)是一个n阶完全图,我们得到下列结果:(1)若n为奇数,G是n阶群,并且{o(x)│∈G,o(x)≥3}={a1,…,at},则Kn=m1Ca1+…+mtCat。(2)若n为偶数,G是n阶群,T={x│x∈G,o(x)=2}={x0,x1,y1,…,xs,ys},o(xiyi)=bi,i=1,…,s及{o(x)│x∈G,o(x)≥}={a1,…,at 相似文献
4.
具有与任意图正交的(g,f)-因子分解的子图 总被引:2,自引:0,他引:2
设g和f分别是定义在图G的顶点集合V(G)上的整数位函数且对每个x∈V(G)有0≤g(x)≤f(x).证明了:若G是一个(mg+k,mf-k)-图,1≤k<m,H是G中一个给定的有k条边的子图,则G有一个子图L使得L有一个(g,f)-因子分解与H正交. 相似文献
5.
6.
图中具有某种性质的子图 总被引:1,自引:0,他引:1
汪长平 《高校应用数学学报(A辑)》1999,14(4):485-488
设g和f是定义在图G的顶点集合V(G)上的整数值函数且对每个x∈V(G)都有0≤g(x)≤f(x)且g(x)和f(x)为偶数。本文证明了:若G是一个(mg+k-1,mf-k+1)-图,1≤k≤m,H是G中一个给定的有k条边的子图,则G存在一个子图R使得R有一个(g,f)-因子分解与H正交。 相似文献
7.
非退化扩散过程的极性的必要性 总被引:3,自引:1,他引:2
设X(t)是一N维非退化扩散过程.设 E(0,∞)和 F RN都为紧集.本文给出了:P(X-1(F)∩E≠φ)>0,P(X-1(F)≠φ)>0和P(X(E)≠φ)>0的充分条件.证明了:i)设 N≥ 3,a)若 dim(F)<N-2,则 P(X-1(F)=φ)=1; b)若dim(F)>N-2,则 P(X-1(F)≠φ)>0; c)存在 F1 RN,F2 RN,dim(F1)=dim(F2)=N-2,但有P(X-1(F1)=φ)=1,P(X-1(F2)≠φ)>0.ii)设N=1,a)若dim(E)>1/2,则x∈R1,P(X-1(x)∩E≠φ)>0;b)存在E(0,∞),dim(E)=1/2,使得x∈R1,P(X-1(x)∩E≠φ)>0.以上这些结果,不仅仅是Brown运动的推广,即使就Brown运动的情形而言,其中有些结果也是新的. 相似文献
8.
9.
叶宏博证明了当Δ≥5时没有度序列是2rΔ2r的Δ-临界图.Kayathri推广了上述结果,证明了当Δ≥5时,没有同时满足下列两个条件的Δ-临界图:(a)G有一个2度点x;设y,z是x的两个邻接点;(b)有一主项点y1∈NG(y)(y1≠y)与-2度点邻接.我们对上述结果进一步推广,证明了条件(b)不是必要的;只要y1与一个度数小于Δ-1的点邻接即可(可以不是2度点). 相似文献
10.
本文证明了有限群G是Abel群当且仅当G_r满足下列条件:(Ⅰ) G有一个幂自同构 a使得 CG(a)是一个初等 AbelZ一群.(Ⅱ)G没有子群与2-群<a,b|a~2~n=b~2~m=1,a~b=a~(1+2)~(n-1)>同构,其中n≥3,n≥m.利用该结果,作者还证明若有限群G有一个幂自同构a使得C_G(a)是一个初等Abel2-群,则G是幂零群 相似文献
11.
12.
A graph is symmetric if its automorphism group acts transitively on the set of arcs of the graph. In this paper, we classify hexavalent symmetric graphs of order for each prime . 相似文献
13.
图X称为边正则图,若X的自同构群Aut(X)在X的边集上的作用是正则的.本文考察了三度边正则图与四度Cayley图的关系,给出了一个由四度Cayley图构造三度边正则图的方法,并且构造了边正则图的三个无限族. 相似文献
14.
Brendan D. McKay 《Journal of Graph Theory》2017,85(1):7-11
A graph is called hypohamiltonian if it is not hamiltonian but becomes hamiltonian if any vertex is removed. Many hypohamiltonian planar cubic graphs have been found, starting with constructions of Thomassen in 1981. However, all the examples found until now had 4‐cycles. In this note we present the first examples of hypohamiltonian planar cubic graphs with cyclic connectivity 5, and thus girth 5. We show by computer search that the smallest members of this class are three graphs with 76 vertices. 相似文献
15.
A graph is called edge-primitive if its automorphism group acts primitively on its edge set. In 1973, Weiss (1973) determined all edge-primitive graphs of valency three, and recently Guo et al. (2013,2015) classified edge-primitive graphs of valencies four and five. In this paper, we determine all edge-primitive Cayley graphs on abelian groups and dihedral groups. 相似文献
16.
A regular graph X is called semisymmetric if it is edge-transitive but not vertex-transitive. For G ≤ AutX, we call a G-cover X semisymmetric if X is semisymmetric, and call a G-cover X one-regular if Aut X acts regularly on its arc-set. In this paper, we give the sufficient and necessary conditions for the existence of one-regular or semisymmetric Zn-Covers of K3,3. Also, an infinite family of semisymmetric Zn×Zn-covers of K3,3 are constructed. 相似文献
17.
In this paper we give a classification of a family of symmetric graphs with complete 2-arc-transitive quotients. Of particular interest are two subfamilies of graphs which admit an arc-transitive action of a projective linear group. The graphs in these subfamilies can be defined in terms of the cross ratio of certain 4-tuples of elements of a finite projective line, and thus may be called the second type ‘cross ratio graphs’, which are different from the ‘cross ratio graphs’ studied in [A. Gardiner, C. E. Praeger, S. Zhou, Cross-ratio graphs, J. London Math. Soc. (2) 64 (2001), 257–272]. We also give a combinatorial characterisation of such second type cross ratio graphs. 相似文献
18.
Let Г be a G-symmetric graph admitting a nontrivial G-invariant partition
. Let Г
be the quotient graph of Г with respect to
. For each block B ∊
, the setwise stabiliser GB of B in G induces natural actions on B and on the neighbourhood Г
(B) of B in Г
. Let G(B) and G[B] be respectively the kernels of these actions. In this paper we study certain “local actions" induced by G(B) and G[B], such as the action of G[B] on B and the action of G(B) on Г
(B), and their influence on the structure of Г.
Supported by a Discovery Project Grant (DP0558677) from the Australian Research Council and a Melbourne Early Career Researcher
Grant from The University of Melbourne. 相似文献
19.
Alfredo García Ferran Hurtado Clemens Huemer Javier Tejel Pavel Valtr 《Computational Geometry》2009,42(9):913-922
Let S be a set of n4 points in general position in the plane, and let h<n be the number of extreme points of S. We show how to construct a 3-connected plane graph with vertex set S, having max{3n/2,n+h−1} edges, and we prove that there is no 3-connected plane graph on top of S with a smaller number of edges. In particular, this implies that S admits a 3-connected cubic plane graph if and only if n4 is even and hn/2+1. The same bounds also hold when 3-edge-connectivity is considered. We also give a partial characterization of the point sets in the plane that can be the vertex set of a cubic plane graph. 相似文献
20.
We describe work on the relationship between the independently-studied polygon-circle graphs and word-representable graphs.A graph G = (V, E) is word-representable if there exists a word w over the alpha-bet V such that letters x and y form a subword of the form xyxy ⋯ or yxyx ⋯ iff xy is an edge in E. Word-representable graphs generalise several well-known and well-studied classes of graphs [S. Kitaev, A Comprehensive Introduction to the Theory of Word-Representable Graphs, Lecture Notes in Computer Science 10396 (2017) 36–67; S. Kitaev, V. Lozin, “Words and Graphs”, Springer, 2015]. It is known that any word-representable graph is k-word-representable, that is, can be represented by a word having exactly k copies of each letter for some k dependent on the graph. Recognising whether a graph is word-representable is NP-complete ([S. Kitaev, V. Lozin, “Words and Graphs”, Springer, 2015, Theorem 4.2.15]). A polygon-circle graph (also known as a spider graph) is the intersection graph of a set of polygons inscribed in a circle [M. Koebe, On a new class of intersection graphs, Ann. Discrete Math. (1992) 141–143]. That is, two vertices of a graph are adjacent if their respective polygons have a non-empty intersection, and the set of polygons that correspond to vertices in this way are said to represent the graph. Recognising whether an input graph is a polygon-circle graph is NP-complete [M. Pergel, Recognition of polygon-circle graphs and graphs of interval filaments is NP-complete, Graph-Theoretic Concepts in Computer Science: 33rd Int. Workshop, Lecture Notes in Computer Science, 4769 (2007) 238–247]. We show that neither of these two classes is included in the other one by showing that the word-representable Petersen graph and crown graphs are not polygon-circle, while the non-word-representable wheel graph W5 is polygon-circle. We also provide a more refined result showing that for any k ≥ 3, there are k-word-representable graphs which are neither (k −1)-word-representable nor polygon-circle. 相似文献