Excluded Minors and the Ribbon Graphs of Knots

In this article we consider minors of ribbon graphs (or, equivalently, cellularly embedded graphs). The theory of minors of ribbon graphs differs from that of graphs in that contracting loops is necessary and doing this can create additional vertices and components. Thus, the ribbon graph minor relation is incompatible with the graph minor relation. We discuss excluded minor characterizations of minor closed families of ribbon graphs. Our main result is an excluded minor characterization of the family of ribbon graphs that represent knot and link diagrams.     

单圈图的极小能量

For a simple graph G, the energy E(G) is defined as the sum of the absolute values of all eigenvalues of its adjacency matrix. Let Undenote the set of all connected unicyclic graphs with order n, and Ur n= {G ∈ Un| d(x) = r for any vertex x ∈ V(Cl)}, where r ≥ 2 and Cl is the unique cycle in G. Every unicyclic graph in Ur nis said to be a cycle-r-regular graph.In this paper, we completely characterize that C39(2, 2, 2) ο Sn-8is the unique graph having minimal energy in U4 n. Moreover, the graph with minimal energy is uniquely determined in Ur nfor r = 3, 4.     

三维Mbius变换中的Beardon定理

本文利用高维保向Ｍｏｂｉｕｓ变换的Ｃｌｉｆｆｏｒｄ矩阵表示，对三维广义椭圆Ｍｏｂｉｕｓ群，椭圆Ｍｏｂｉｕｓ群及运动Ｍｏｂｉｕｓ群进行了讨论，得到了它们各自的特征。     

The Hypersurfaces in a Unit Sphere with Nonnegative Mobius Sectional Curvature

Let x ： M→S^n＋1 be a hypersurface in the （n ＋ 1）-dimensional unit sphere S^n＋1 without umbilic point. The Mobius invariants of x under the Mobius transformation group of S^n＋1 are Mobius metric, Mobius form, Mobius second fundamental form and Blaschke tensor. In this paper, we prove the following theorem： Let x ： M→S^n＋1 （n≥2） be an umbilic free hypersurface in S^n＋1 with nonnegative Mobius sectional curvature and with vanishing Mobius form. Then x is locally Mobius equivalent to one of the following hypersurfaces： （i） the torus S^k（a） × S^n-k（√1- a^2） with 1 ≤ k ≤ n - 1; （ii） the pre-image of the stereographic projection of the standard cylinder S^k × R^n-k belong to R^n＋1 with 1 ≤ k ≤ n- 1; （iii） the pre-image of the stereographic projection of the Cone in R^n＋1 ： -↑x（u, v, t） = （tu, tv）, where （u,v, t）∈S^k（a） × S^n-k-1（ √1-a^2）× R^＋.     

Graphs equienergetic with edge-deleted subgraphs

The energy of a graph is the sum of the absolute values of the eigenvalues of its adjacency matrix. Two graphs are equienergetic if they have the same energy. We construct infinite families of graphs equienergetic with edge-deleted subgraphs.     

全变换图的基本性质

我们引入了四对变换图,其中有一对是全图和它的补图。我们研究这些变换图的基本性质。     

A Uniformly Quasiconformal Group Not Isomorphic to a Mobius Group

We explicitly give a group not isomorphic to any group of Mobius transformations of the three-dimensional sphere and acting quasiconformally on the three-dimensional sphere.     

循环图能量的一个上界

本文讨论循环图的能量,得到循环图能量上界的一个估计值.进一步得到整循环图能量的两个计算公式.     

随机Volterra积分方程的非标准及演解法

本文借助星型Ｍｏｂｉｕｓ反演得到随机积分Ｖｏｌｔｅｒｒａ方程的一个全新解法．它旨在揭示离散反演与连续反演的内在联系，为探索各类反演的统一性提供了一种可能的研究途径．     

高维Mbius群的分类、生成系统和离散准则

本文利用高维Ｍｏｂｉｕｓ变换的Ｃｌｉｆｆｏｒｄ矩阵表示，给出了高维Ｍｏｂｉｕｓ子群的一个分类定理，证明了非初等子群的最小纯斜驶生成系统的存在性，得到了一条离散准则。     

Decomposition of Complete Graphs into Isomorphic Complete Bipartite Graphs

A decomposition of a complete graph into disjoint copies of a complete bipartite graph is called a ‐design of order n. The existence problem of ‐designs has been completely solved for the graphs for , for , K_{2, 3} and K_{3, 3}. In this paper, I prove that for all , if there exists a ‐design of order N, then there exists a ‐design of order n for all (mod ) and . Giving necessary direct constructions, I provide an almost complete solution for the existence problem for complete bipartite graphs with fewer than 18 edges, leaving five orders in total unsolved.     

Bubble-sort图和Modified Bubble-sort图的自同构群

Bubble-Sort图和Modified Bubble-Sort图是两类特殊的Cayley图,由于其在网络构建中的应用而受到广泛关注.本文完全确定了这两类图的自同构群.     

半二面体群的小度数Cayley图

群G的一个Cayley图X=Cay(G,S)称为正规的,如果右乘变换群R(G)在Aut X中正规.研究了4m阶半二面体群G=〈a,b a2m=b2=1,ab=am-1〉的3度和4度Cayley图的正规性,其中m=2r且r>2,并得到了几类非正规的Cayley图.     

强算术图

一个（p,q)-图G被为是强（k,d)-算术图,如果存在一个由G的顶点集到模q的整数群Zq的单射,使得相邻两顶点标号的和导出的边值为算术级数,k,k d,……,k (q-1)d,本文讨论了这类标号图的结构和一些性质。     

关于紧图和超紧图的几个结果

给出了一些 新的紧图,并对 不是超紧的紧图 作了一些讨论     

门槛图与度极大图

证明了门槛图与度极大图是一类图的两种不同说法,同时用图的对角限制极左矩阵刻画这一类图的结构。     

一类拟二面体群的四度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图的同构类型.     

四圈图的Spread

图的spread定义为图的邻接矩阵的最大特征值与最小特征值的差.本文确定了n(n≥84)顶点四圈图中spread最大的唯一的图.     

Unitary Graphs

Unitary graphs are arc‐transitive graphs with vertices the flags of Hermitian unitals and edges defined by certain elements of the underlying finite fields. They played a significant role in a recent classification of a class of arc‐transitive graphs that admit an automorphism group acting imprimitively on the vertices. In this article, we prove that all unitary graphs are connected of diameter two and girth three. Based on this, we obtain, for any prime power , a lower bound of order on the maximum number of vertices in an arc‐transitive graph of degree and diameter two.