一类用仿射几何构造的半对称图

图X是一个有限简单无向图,如果图X是正则的且边传递但非点传递,则称X是半对称图.主要利用仿射几何构造了一类2p~n阶连通p~4度的半对称图的无限族,其中p≥n≥11.     

2p~n阶连通p~2度的半对称图

称一个有限简单无向图X是半对称图,如果图X是正则的且边传递但非点传递.本文主要利用仿射几何构造了一类2p~n阶连通p~2度的半对称图的无限族,其中p≥n≥5.     

第二小阶数的双本原半对称图

如果一个正则图是边传递但不是点传递的,那么我们称它是半对称的.每一个半对称图X必定是两部分点数相等的二部图,并且它的自同构群Aut(X)在每一部分上是传递的.如果一个半对称图的自同构群在每一部分上作用是本原的,那么我们称它是双本原的.本文决定了第二小阶数的双本原半对称图.     

利用有限仿射几何构作Cartesian认证码

设 0 相似文献   

6p2阶的三度半对称图

正则图G 称为G-半对称图, 如果G 的自同构群A := AutG 有一个子群G在G 的边集上传递, 但在其点集上不传递, 特别地, 当G= A时Γ 称为半对称图. 本文旨在考察素数度的(G-)半对称图. 首先给出了素度数的(G-)半对称图的群论刻画, 其次对6p²阶的三度半对称图进行了完全分类, 其中p是奇素数.     

一类图设计的构造

设Kv是一个v点完全图,G是一个有限简单图,Kv上的一个图设计G-GD(v)是一个对子(X,B),其中X是Kv的顶点集合,B是Kv的一些与G同构的子图(称为区组)的集合,使得Kv的任意一条边恰出现在B的一个区组中．文中讨论的简单图是C(r)10,即带有一条弦的10长圈(含有11条边),其中r表示弦的两个端点之间的顶点个数,1≤r≤4．给出了C^（r）10-GD(v)的存在谱：v=0,1(mod11)且v≥11．     

线性流形上实对称半正定阵的一类反问题

1　引　　言文中记Rn×m为所有n×m阶实阵集合,SRn×n为所有n阶实对称阵集合,Pn表示所有n阶实对称半正定阵集合,A≥0表示方阵A对称半正定.A+、R(A)、N(A)分别表示矩阵A的Moore-Penrose广义逆,列空间和零空间,‖·‖表示Froblnius范数.对于Z.Y∈Rn×k,令S={A∈Pn|AZ=Y,ZTY∈PK,R(YT)=R(YTZ)}(1.1)　　现考虑如下问题:问题　给定X.B∈Rn×m,找A∈S,使得AX=B(1.2)　　问题　给定A∈Rn×n,找A∈SE,使得‖A-A‖=infA∈SE‖A-A‖(1.3)其中SE是问题的解集合.问题与具有重要的应用背景,当Y=ZΛ,Λ=diag(λ1,λ2,…     

线性流形上实对称半正定阵的一类逆特征值问题

线性流形上实对称半正定阵的一类逆特征值问题廖安平,郭忠（湖南大学应用数学系）ＡＣＬＡＳＳＯＦＩＮＶＥＲＳＥＥＩＧＥＮＶＡＬＵＥＰＲＯＢＬＥＭＳＦＯＲＲＥＡＬＳＹＭＭＥＴＲＩＣＳＥＭＩ－ＰＯＳＩＴＩＶＥＤＥＦＩＮＩＴＥＯＮＡＬＩＮＥＡＲＭＡＮＩＦＯＬＤ...     

齐次对称多项式的半正定性

给出了某些齐次对称多项式半正定的充分必要条件,并举例说明其应用.     

Biprimitive Graphs of Smallest Order

A regular and edge-transitive graph which is not vertex-transitive is said to be semisymmetric. Every semisymmetric graph is necessarily bipartite, with the two parts having equal size and the automorphism group acting transitively on each of these parts. A semisymmetric graph is called biprimitive if its automorphism group acts primitively on each part. In this paper biprimitive graphs of smallest order are determined.     

Semisymmetric cubic graphs as regular covers of K 3,3

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.     

Non-Cayley Vertex-Transitive Graphs of Order Twice the Product of Two Odd Primes

For a positive integer n, does there exist a vertex-transitive graph Γ on n vertices which is not a Cayley graph, or, equivalently, a graph Γ on n vertices such that Aut Γ is transitive on vertices but none of its subgroups are regular on vertices? Previous work (by Alspach and Parsons, Frucht, Graver and Watkins, Marusic and Scapellato, and McKay and the second author) has produced answers to this question if n is prime, or divisible by the square of some prime, or if n is the product of two distinct primes. In this paper we consider the simplest unresolved case for even integers, namely for integers of the form n = 2pq, where 2 < q < p, and p and q are primes. We give a new construction of an infinite family of vertex-transitive graphs on 2pq vertices which are not Cayley graphs in the case where p ≡ 1 (mod q). Further, if p ? 1 (mod q), p ≡ q ≡ 3(mod 4), and if every vertex-transitive graph of order pq is a Cayley graph, then it is shown that, either 2pq = 66, or every vertex-transitive graph of order 2pq admitting a transitive imprimitive group of automorphisms is a Cayley graph.     

Covers of Point-Hyperplane Graphs

A cover of the non-incident point-hyperplane graph of projective dimension 3 for fields of characteristic 2 is constructed. For fields of even order larger than 2, this leads to an elementary construction of the non-split extension of SL₄( )by ⁶.     

Super-edge-graceful Labelings of Some Cubic Graphs

The notion of super-edge-graceful graphs was introduced by Mitchem and Simoson in 1994.However, few examples except trees are known. In this paper, we exhibit two classes of infinitely many cubic graphs which are super-edge-graceful. A conjecture is proposed.     

An infinite family of biprimitive semisymmetric graphs

A regular and edge-transitive graph that is not vertex-transitive is said to be semisymmetric. Every semisymmetric graph is necessarily bipartite, with the two parts having equal size and the automorphism group acting transitively on each of these two parts. A semisymmetric graph is called biprimitive, if its automorphism group acts primitively on each part. In this article, a classification of biprimitive semisymmetric graphs arising from the action of the group PSL(2, p), p ≡ ±1 (mod 8) a prime, acting on cosets of S₄ is given, resulting in several new infinite families of biprimitive semisymmetric graphs. © 1999 John Wiley & Sons, Inc. J Graph Theory 32: 217–228, 1999     

一类拟二面体群的四度Cayley图的正规性

群G的一个Cayley图X=Cay(G,S)称为正规的,如果右乘变换群R(G)在AutX中正规.研究了4m阶拟二面体群G=a,b|a~(2m)=b~2=1,a~b=a~(m+1)的4度Cayley图的正规性,其中m=2~r,且r2,并得到拟二面体群的Cayley图的同构类型.