关于交换群上的Cayley有向图的正规性

Cayley有向图X=Cay(G,S)叫做正规的,如果G的右正则表示R(G)在X的全自同构群Aut(X)中正规,我们定出了交换群上的小度数的非正规的Cayley有向图, 并给出了一个猜想．应用这个结果,给出了pn(n≤2)个点上的度数不超过3的有向对称图的分类,这里p是一个奇素数．     

对称群上的一类Cayley图的边传递性和Hamilton性

Let Sn be the symmetric group,g+I=(123i),g-I=(1i32) and M+n={g+I:4≤I≤n},then M+n is a minimal generating set of Sn,where n≥5.It is proved that Cayley graph Cay(Sn,M+n∪M-n) is Hamiltonian and edge symmetric.     

THE NORMALITY OF CAYLEY GRAPHS OF SIMPLE GROUP A5 WITH SMALL VALENCIES

Let G be a finite group and S a subset of G not containing the identity element 1. We define the Cayley (di)graph X = Cay(G, S) of G with respect to S by V(X) = G,E(X) = {(g, sg) [ g ∈ G, s ∈ S}. A Cayley (di)graph X = Cay(G, S) is called normal if GR A = Aut(X). In this paper we prove that if S = {a, b, c} is a 3-generating subset of G = A5 not containing the identity 1, then X = Cay(G, S) is a normal Cayley digraph.     

HAMILTONIAN DECOMPOSITION OF CAYLEY GRAPHS OF ORDERS p~2 AND pq

1. IntroductionLet G be a finite group and S a subset of G such that S--1 ~ S, and 1 f S. The Cayleygraph Cay (G, S) is defined as the simple graph with V ~ G, and E = {glgZ I g,'g, or g,'g,6 S, gi, gi E G}. Cay (G, S) is vertex-transitive, and it is connected if and only if (S) = G,i.e. S is a generating set of G[1]. If G = Zn, then Cay (Zn, S) is called a circulant graph. Ithas been proved that any connected Cayley graph on a finite abelian group is hamiltonianl2].Furthermore, …     

给定边连通度的图的最小距离谱半径(英文)

本文研究了边连通度为r的n阶连通图中距离谱半径最小的极图问题,利用组合的方法,确定了K(n-1,r)为唯一的极图,其中K(n-1,r)是由完全图K_(n-1)添加一个顶点v以及连接v与K_(n-1)中r个顶点的边所构成.上述结论推广了极图理论中的相关结果.     

AUTOMORPHISM GROUPS OF 4-VALENT CONNECTED CAYLEY GRAPHS OF p-GROUPS

61. IntroductionLet G be a trite grouP and S a subs6t of G such thst 1' S and S = S--1. The Cayleygraph X = Cay(G, S) Of G with respect to S is defined to have vertex set V(X) = G and edgeset E(X) = {(g, ag) I g E G, s E' S}. ~ the defection the following two faCts are obvious:(1) the automorphism group Ant(X) of X contains GR, the right regular representation ofG, as a subgroup, and (2) X is cormected if and only if S generates the group G.FOr a Cayley graph X = Cay(G, S) Of …     

对称群上Cayley图的DNA计算

有一类图称为Cayley图或群图.猜想每个Cayley图都是Hamilton图.求Cayley图和有向Cayley图中的Hamilton圈和路自然产生在计算科学里.这篇文章研究了对称群上Cayley图的DNA计算和给出了求它的Hamilton圈的DNA算法.     

极小Cayley图的限制性边连通度

一个连通图X的边集的一个子集C称为一个限制性边割,如果它是一个边割,且X／C不含孤立点。X的限制性边连通度λ′（X）定义为所有限制性边割的最小基数。本文完全决定了极小Cayley图的限制性边连通度。     

无向de-Bruijn图的超级边连通性和限制性边连通度

super-λ和限制性边连通度是两个比边连通度更能刻画网络可行性的参数。本文证明了无向无向de-Bruijn图UB（d,n)是super-λ（d≥2,n≥2)。对n≥4，我们证明了UB（2,n)的限制性边连通度为4；UB（2，3）的限制性边连通度是3。对d≥3我们指出UB(d,n)(n≥3)的限制性连连通度λ‘，满足2d-2λ‘≤4d-4。     

On 3-restricted edge connectivity of undirected binary Kautz graphs

An edge cut of a connected graph is m-restricted if its removal leaves every component having order at least m. The size of minimum m-restricted edge cuts of a graph G is called its m-restricted edge connectivity. It is known that when m≤4, networks with maximal m-restricted edge connectivity are most locally reliable. The undirected binary Kautz graph UK(2,n) is proved to be maximal 2- and 3-restricted edge connected when n≥3 in this work. Furthermore, every minimum 2-restricted edge cut disconnects this graph into two components, one of which being an isolated edge.     

4连通图的可去边与4连通图的构造

本文引进了４连通图的可去边的概念,,并证明了４连通图Ｇ中不存在可去边的充要条件是Ｇ＝Ｃ５或Ｃ６,同时给出了ｎ阶４连通图的一个新的构造方法．     

可迁图的超常边连通度的最优性

图的超常边连通度是图的边连通度概念的推广,对于n阶点可迁或正则边可迁的简单连通图来说,它的h阶超常边连通度λ_h一定存在(1≤h≤n/2)。本文证明了:当d_-正则的n_-阶点可迁简单连通图满足n≥6,d≥4且围长g≥5时,或d_-正则的n_-阶边可迁简单连通图满足n≥6,d≥4且围长g≥4时,对于任何的h:1≤h≤min{g-1,n/2},λ_h达到其最大可能值,即λ_h=hd-2(h-1)。     

DIAGNOSABILITY OF CAYLEY GRAPH NETWORKS GENERATED BY TRANSPOSITION TREES UNDER THE COMPARISON DIAGNOSIS MODEL

Diagnosability of a multiprocessor system is one important study topic.Cayley graph network Cay(T_n,S_n) generated by transposition trees Tnis one of the attractive underlying topologies for the multiprocessor system.In this paper,it is proved that diagnosability of Cay(T_n,S_n) is n-1 under the comparison diagnosis model for n ≥ 4.     

一些积图的点可区别均匀边色数

本文研究了积图的点可区别均匀边染色问题.利用构造法得到了积图G×G的点可区别均匀边染色的一个结论,并且获得了等阶的完全图与完全图、星与星、轮与轮的积图的点可区别均匀边色数,验证了它们满足点可区别均匀边染色猜想(VDEECC).     

The degree-diameter problem for circulant graphs of degrees 10 and 11

This paper considers the degree-diameter problem for undirected circulant graphs. For degrees 10 and 11, newly discovered families of circulant graphs of arbitrary diameter are presented which are largest known and are conjectured to be extremal. They are also the largest-known Abelian Cayley graphs of these degrees. For each such family, the order of every graph in the family is defined by a quintic polynomial function of the diameter which is specific to the family. The elements of the generating set for each graph are similarly defined by a set of polynomials in the diameter. The existence of the graphs in the degree 10 families has been proved for all diameters. These graphs are consistent with a conjecture on the order of extremal Abelian Cayley and circulant graphs of any degree and diameter.     

关于Abel群上Cayley图的Hamilton圈分解

设Ｇ（Ｆ，Ｔ∩Ｔ＾－１）是有限Ａｂｅｌ群Ｆ上的Ｃａｙｌｅｙ图，Ｔ∩Ｔ＾－１只含２阶元，此文证明了当Ｔ是Ｆ的极小生成元集时，若ｄ（Ｇ）＝２ｋ，则Ｇ是ｋ个边不相交的Ｈａｍｉｌｔｏｎ圈的并，若ｄ（Ｇ）＝２ｋ＋１，则Ｇ是ｋ个边不相交的Ｈａｍｉｌｔｏｎ圈与一个１－因子的并。     

Regular Cayley maps for finite abelian groups

A regular Cayley map for a finite group A is an orientable map whose orientation-preserving automorphism group G acts regularly on the directed edge set and has a subgroup isomorphic to A that acts regularly on the vertex set. This paper considers the problem of determining which abelian groups have regular Cayley maps. The analysis is purely algebraic, involving the structure of the canonical form for A. The case when A is normal in G involves the relationship between the rank of A and the exponent of the automorphism group of A, and the general case uses Ito's theorem to analyze the factorization G = AY, where Y is the (cyclic) stabilizer of a vertex. Supported in part by the N.Z. Marsden Fund (grant no. UOA0124).     

Cayley graphs of the group ℤ4 and limits for minimal vertex-primitive graphs of HA-type

We point out a countable set of pairwise nonisomorphic Cayley graphs of the group ℤ⁴ that are limit for finite minimal vertex-primitive graphs admitting a vertex-primitive automorphism group containing a regular Abelian normal subgroup. Supported by RFBR grant No. 06-01-00378. __________ Translated from Algebra i Logika, Vol. 47, No. 2, pp. 203–214, March–April, 2008.     

Cayley图的边Hamilton性

设Ｘ是有限群Ｇ的一个生成集．Ｃａｙ（Ｘ：Ｇ）表示生成集为Ｘ的Ｇ上的Ｃａｒｌｅｙ图，其顶点集为Ｇ，其边集为所有无序对［ａ，ｂ］组成的集合，其中ａ，ｂ∈Ｇ，ａ－１ｂ∈Ｘ∪Ｘ－１（Ｘ－１＝｛ｘ－１｜ｘ∈Ｘ｝）．若图的每条边都在的Ｈａｍｉｌｔｏｎ圈上，则称图是边－Ｈａｍｉｌｔｏｎ图．本文证明了：当Ｇ为ｐ－群或Ｈａｍｉｌｔｏｎ群时，若Ｘ含有Ｇ的中心元，则Ｃａｙ（Ｘ：Ｇ）是边－Ｈａｍｉｌｔｏｎ图．