3阶不可约符号模式的精细惯量极小临界集

Let S be a nonempty, proper subset of all possible refined inertias of real matrices of order n. The set S is a critical set of refined inertias for irreducible sign patterns of order n,if for each n × n irreducible sign pattern A, the condition S ? ri(A) is sufficient for A to be refined inertially arbitrary. If no proper subset of S is a critical set of refined inertias, then S is a minimal critical set of refined inertias for irreducible sign patterns of order n.All minimal critical sets of refined inertias for full sign patterns of order 3 have been identified in [Wei GAO, Zhongshan LI, Lihua ZHANG, The minimal critical sets of refined inertias for 3×3 full sign patterns, Linear Algebra Appl. 458(2014), 183–196]. In this paper, the minimal critical sets of refined inertias for irreducible sign patterns of order 3 are identified.     

On p-nilpotency and minimal subgroups of finite groups

We call a subgroup H of a finite group G c-supplemented in G if there exists a subgroup K of G such that G = HK and H ∩ K ≤ core(H). In this paper it is proved that a finite group G is p-nilpotent if G is S4-free and every minimal subgroup of P n GN is c-supplemented in NG(P), and when p = 2 P is quaternion-free, where p is the smallest prime number dividing the order of G, P a Sylow p-subgroup of G. As some applications of this result, some known results are generalized.     

单圈图的极小能量

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.     

Bound on <Emphasis Type="Italic">m</Emphasis>-restricted Edge Connectivity

An m-restricted edge cut is an edge cut that separates a connected graph into a disconnected one with no components having order less than m. m-restrict edge connectivity λm is the cardinality of a minimum m-restricted edge cut. Let G be a connected k-regular graph of order at least 2m that contains m-restricted edge cuts and X be a subgraph of G. Let θ(X) denote the number of edges with one end in X and the other not in X and ξm=min{θ(X) ;X is a connected vertex-induced subgraph of order m}.It is proved in this paper that if G has girth at least m/2 2,then λm≤ξm.The upper bound of λm is sharp.     

Rainb ow Vertex-connection Numb er of Ladder and M¨obius Ladder

A vertex-colored graph G is said to be rainbow vertex-connected if every two vertices of G are connected by a path whose internal vertices have distinct colors, such a path is called a rainbow path. The rainbow vertex-connection number of a connected graph G, denoted by rvc(G), is the smallest number of colors that are needed in order to make G rainbow vertex-connected. If for every pair u, v of distinct vertices, G contains a rainbow u-v geodesic, then G is strong rainbow vertex-connected. The minimum number k for which there exists a k-vertex-coloring of G that results in a strongly rainbow vertex-connected graph is called the strong rainbow vertex-connection number of G, denoted by srvc(G). Observe that rvc(G) ≤ srvc(G) for any nontrivial connected graph G. In this paper, for a Ladder Ln, we determine the exact value of srvc(Ln) for n even. For n odd, upper and lower bounds of srvc(Ln) are obtained. We also give upper and lower bounds of the (strong) rainbow vertex-connection number of M¨obius Ladder.     

Ladder图和Mbius Ladder图的彩虹点连通数（英文）

A vertex-colored graph G is said to be rainbow vertex-connected if every two vertices of G are connected by a path whose internal vertices have distinct colors, such a path is called a rainbow path. The rainbow vertex-connection number of a connected graph G, denoted by rvc(G), is the smallest number of colors that are needed in order to make G rainbow vertex-connected. If for every pair u, v of distinct vertices, G contains a rainbow u-v geodesic, then G is strong rainbow vertex-connected. The minimum number k for which there exists a k-vertex-coloring of G that results in a strongly rainbow vertex-connected graph is called the strong rainbow vertex-connection number of G, denoted by srvc(G). Observe that rvc(G) ≤ srvc(G) for any nontrivial connected graph G. In this paper, for a Ladder L_n,we determine the exact value of srvc(L_n) for n even. For n odd, upper and lower bounds of srvc(L_n) are obtained. We also give upper and lower bounds of the(strong) rainbow vertex-connection number of Mbius Ladder.     

Detection of Some Elements in the Stable Homotopy Groups of Spheres

Let A be the mod p Steenrod algebra and S be the sphere spectrum localized at an odd prime p. To determine the stable homotopy groups of spheres π＊S is one of the central problems in homotopy theory. This paper constructs a new nontrivial family of homotopy elements in the stable homotopy groups of spheres πp^nq＋2pq＋q-3S which isof order p and is represented by kohn ∈ ExtA^3,P^nq＋2pq＋q（Zp,Zp） in the Adams spectral sequence, wherep 〉 5 is an odd prime, n ≥3 and q = 2（p-1）. In the course of the proof, a new family of homotopy elements in πp^nq＋（p＋1）q-1V（1） which is represented by β＊i＇＊i＊（hn） ∈ ExtA^2,pnq＋（p＋1）q＋1 （H^＊V（1）, Zp） in the Adams sequence is detected.     

DEGREE 3 ALGEBRAIC MINIMAL SURFACES IN THE 3-SPHERE

We give a local analytic characterization that a minimal surface in the 3-sphere S3 R4 defined by an irreducible cubic polynomial is one of the Lawson’s minimal tori.This provides an alternative proof of the result by Perdomo(Characterization of order 3 algebraic immersed minimal surfaces of S3,Geom.Dedicata 129(2007),23-34).     

Nordhaus-Gaddum results for the sum of the induced path number of a graph and its complement

The induced path number ρ(G) of a graph G is defined as the minimum number of subsets into which the vertex set of G can be partitioned so that each subset induces a path.Broere et al.proved that if G is a graph of order n,then n~(1/2) ≤ρ(G) + ρ(■) ≤ [3n/2].In this paper,we characterize the graphs G for which ρ(G) + ρ(■) = [3n/2],improve the lower bound on ρ(G) + ρ(■) by one when n is the square of an odd integer,and determine a best possible upper bound for ρ(G) + ρ(■) when neither G nor ■ has isolated vertices.     

Monomorphism categories associated with symmetric groups and parity in finite groups

Monomorphism categories of the symmetric and alternating groups are studied via Cayley’s Em-bedding Theorem. It is shown that the parity is well defined in such categories. As an application, the parity in a finite group G is classified. It is proved that any element in a group of odd order is always even and such a group can be embedded into some alternating group instead of some symmetric group in the Cayley’s theorem. It is also proved that the parity in an abelian group of even order is always balanced and the parity in an nonabelian group is independent of its order.     

关于4p阶3度Cayley图的正规性的一点注记

群G的Cayley图Cay(G,S)称为是正规的,如果G的右正则表示R(G)在Cay(G,S)的全自同构群中正规.设p为奇素数,相关文献决定了4p阶连通3度Cayley图的正规性.本文给出了上述文献的主要结果的一个新的简短的证明.     

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 …     

Finite NPDM-groups

In this paper the classification is given for finite groups in which the normalizer of every non-normal cyclic subgroup of order divided by the minimal prime of|G|is a maximal subgroup.     

Quasinormal subgroups of order p 2

The location of quasinormal subgroups in a group is not particularly well known. Maximal ones always have to be normal, but little has been proved about the minimal ones. In finite groups, the difficulties arise in the p-groups. Here we prove that, for every odd prime p, a quasinormal subgroup of order p ² in a finite p-group G contains a quasinormal subgroup of G of order p. S. Stonehewer is grateful to the Australian National University for financial support during the preparation of this paper.     

Finite p-groups All of Whose Minimal Nonabelian Subgroups are Nonmetacyclic of Order p3

Assume p is an odd prime. We investigate finite p-groups all of whose minimal nonabelian subgroups are of order p³. Let P₁-groups denote the p-groups all of whose minimal nonabelian subgroups are nonmetacyclic of order p³. In this paper, the P₁-groups are classified, and as a by-product, we prove the Hughes' conjecture is true for the P₁-groups.     

二次极大子群中2阶及4阶循环子群拟正规的有限群

本文讨论２阶及４阶循环子群对群结构的影响．主要结果是下述定理：如果有限群Ｇ满足标题的条件，那么下列情形之一成立：（１）Ｇ有正规Ｓｙｌｏｗ ２－子群；（２） Ｇ为 ２－幂零；（３） Ｇ ≌ Ｓ４；（４） Ｇ＝ＰＱ，其中 Ｐ为阶 ２４广义四元数群， Ｑ为 ３阶循环群；（５） Ｇ ≌ Ａ５或 ＳＬ（２，５）．     

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

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

一类2nm(m为奇数)阶有限群的构造

本文研究了一类2nm(m为奇数)阶有限群的构造,利用解数论同余方程的方法和群的扩张理论等知识,得到了具有奇数m阶循环正规子群、其补子群为循环群的2nm阶有限群的构造及相关的计数定理.     

特征标次数的重数与可解群结构

非线性不可约特征标次数的重数全部为1的有限群的分类是熟知的.对可解群,本文讨论更一般的,即非线性不可约特征标次数的重数都与群阶互素的有限群的纯群论性质.特别地,得到了非线性不可约特征标次数的重数均小于2p的奇阶群G的分类结果.这里p为群阶|G|的最小素因子.     

无爪3 -正则图的独立数

如果图G的一个集合X中任两个点不相邻, 则称 X 为独立集合. 如果 N[X]=V(G), 则称X是一个控制集合. i(G)(β(G))分别表示所有极大独立集合的最小(最大)基数. γ(G)(Γ(G))表示所有极小控制集合的最小(最大)基数. 在这篇论文中, 作者证明如下结论: (1) 如果 G ∈R 且G 是n阶3 -正则图, 则 γ(G)= i(G), β(G)=n/3. (2) 每个n阶连通无爪3 -正则图 G, 如果 G(G≠ K₄) 且不含诱导子图K₄-e, 则 β(G) =n/3.