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

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

2-阶邻域连通无爪图的Hamilton性

设Ｇ是无爪图．对ｘ∈Ｖ（Ｇ），若Ｇ［Ｎ（ｘ）］不连通，则存在ｙｉ∈Ｖ（Ｇ）－｛ｘ｝（ｉ－１，２），使｜Ｎ（ｙｉ）∩Ｋｉ（ｘ）｜≥２，且｜Ｎ（ｙｉ）∩Ｎ（Ｋｉ＋１（ｘ））｛ｘ｝｜≥２（ｉ模２），那么称无爪图Ｇ是强２－阶邻域连通的，其中Ｋ１（ｘ），Ｋ２（ｘ）分别表示Ｇ［Ｎ（ｘ）］的两个分支．本文证明了：连通且强２－阶邻域连通的无爪图是Ｈａｍｉｌｔｏｎ图．     

完全图圈分解的一种新方法

本文给出完全图圈分解的一种新方法，设Ｋｎ（ｎ≥３）是一个ｎ阶完全图，我们得到下列结果：（１）若ｎ为奇数，Ｇ是ｎ阶群，并且｛ｏ（ｘ）│∈Ｇ，ｏ（ｘ）≥３｝＝｛ａ１，…，ａｔ｝，则Ｋｎ＝ｍ１Ｃａ１＋…＋ｍｔＣａｔ。（２）若ｎ为偶数，Ｇ是ｎ阶群，Ｔ＝｛ｘ│ｘ∈Ｇ，ｏ（ｘ）＝２｝＝｛ｘ０，ｘ１，ｙ１，…，ｘｓ，ｙｓ｝，ｏ（ｘｉｙｉ）＝ｂｉ，ｉ＝１，…，ｓ及｛ｏ（ｘ）│ｘ∈Ｇ，ｏ（ｘ）≥｝＝｛ａ１，…，ａｔ     

具有与任意图正交的(g,f)-因子分解的子图

设ｇ和ｆ分别是定义在图Ｇ的顶点集合Ｖ（Ｇ）上的整数位函数且对每个ｘ∈Ｖ（Ｇ）有０≤ｇ（ｘ）≤ｆ（ｘ）．证明了：若Ｇ是一个（ｍｇ＋ｋ,ｍｆ－ｋ）－图,１≤ｋ＜ｍ,Ｈ是Ｇ中一个给定的有ｋ条边的子图,则Ｇ有一个子图Ｌ使得Ｌ有一个（ｇ,ｆ）－因子分解与Ｈ正交．     

初二上期数学期末检测题

一、填空题（每小题２分,共１０分）１．分解因式：２ｘ２－１３２＝．２．计算：ａｘ－ｙ－ａｙ－ｘ＝．３．当ｘ时,分式５ｘｘ－１有意义．４．若３ｘ＋４ｍ＝５,则ｍ＝．５．如果ａ２＋ｂ２－２ａ－４ｂ＋５＝０,则２－２ｂ＝．二、选择题（每小题３分,共９分）１．下列各式中,计算正确的有（　）．①ａｂ＝ａｍｂｍ　②－５ｂ－６ａ＝－５ｂ６ａ③（－２ｘｙ）２＝２ｘ２ｙ２　④（ａ－ｂ）２＝（ｂ－ａ）２（Ａ）１个　（Ｂ）２个　（Ｃ）３个　（Ｄ）４个２．在公式Ｓ＝１２（ａ＋ｂ）ｈ,已知Ｓ、ｂ、ｈ,则ａ＝（　）．（Ａ）…     

图中具有某种性质的子图

设ｇ和ｆ是定义在图Ｇ的顶点集合Ｖ（Ｇ）上的整数值函数且对每个ｘ∈Ｖ（Ｇ）都有０≤ｇ（ｘ）≤ｆ（ｘ）且ｇ（ｘ）和ｆ（ｘ）为偶数。本文证明了：若Ｇ是一个（ｍｇ＋ｋ－１,ｍｆ－ｋ＋１）－图,１≤ｋ≤ｍ,Ｈ是Ｇ中一个给定的有ｋ条边的子图,则Ｇ存在一个子图Ｒ使得Ｒ有一个（ｇ,ｆ）－因子分解与Ｈ正交。     

非退化扩散过程的极性的必要性

设Ｘ（ｔ）是一Ｎ维非退化扩散过程．设 Ｅ（０，∞）和 Ｆ ＲＮ都为紧集．本文给出了：Ｐ（Ｘ－１（Ｆ）∩Ｅ≠φ）＞０，Ｐ（Ｘ－１（Ｆ）≠φ）＞０和Ｐ（Ｘ（Ｅ）≠φ）＞０的充分条件．证明了：ｉ）设 Ｎ≥ ３，ａ）若 ｄｉｍ（Ｆ）＜Ｎ－２，则 Ｐ（Ｘ－１（Ｆ）＝φ）＝１； ｂ）若ｄｉｍ（Ｆ）＞Ｎ－２，则 Ｐ（Ｘ－１（Ｆ）≠φ）＞０； ｃ）存在 Ｆ１ ＲＮ，Ｆ２ ＲＮ，ｄｉｍ（Ｆ１）＝ｄｉｍ（Ｆ２）＝Ｎ－２，但有Ｐ（Ｘ－１（Ｆ１）＝φ）＝１，Ｐ（Ｘ－１（Ｆ２）≠φ）＞０．ｉｉ）设Ｎ＝１，ａ）若ｄｉｍ（Ｅ）＞１／２，则ｘ∈Ｒ１，Ｐ（Ｘ－１（ｘ）∩Ｅ≠φ）＞０；ｂ）存在Ｅ（０，∞），ｄｉｍ（Ｅ）＝１／２，使得ｘ∈Ｒ１，Ｐ（Ｘ－１（ｘ）∩Ｅ≠φ）＞０．以上这些结果，不仅仅是Ｂｒｏｗｎ运动的推广，即使就Ｂｒｏｗｎ运动的情形而言，其中有些结果也是新的．     

不等式单元测试题

一、选择题１．已知ａ,ｂ∈Ｒ,则（）．（Ａ）若ａ３＞ｂ３,ａｂ＞０,那么１ａ＜１ｂ（Ｂ）若ａｃ＞ｂｃ,那么ａ＞ｂ（Ｃ）若ａ＞ｂ,那么ａｃ２＞ｂｃ２（Ｄ）若ａ２＞ｂ２,ａｂ＞０,那么１ａ＜１ｂ２．下列各组不等式中同解的一组是（）．（Ａ）ｌｇ（ｘ－ａ）２...     

关于临界图的一个定理的推广

叶宏博证明了当Δ≥５时没有度序列是２ｒΔ２ｒ的Δ－临界图．Ｋａｙａｔｈｒｉ推广了上述结果,证明了当Δ≥５时,没有同时满足下列两个条件的Δ－临界图：（ａ）Ｇ有一个２度点ｘ;设ｙ,ｚ是ｘ的两个邻接点;（ｂ）有一主项点ｙ１∈ＮＧ（ｙ）（ｙ１≠ｙ）与－２度点邻接．我们对上述结果进一步推广,证明了条件（ｂ）不是必要的;只要ｙ１与一个度数小于Δ－１的点邻接即可（可以不是２度点）．     

有限Abel群的一个特征

本文证明了有限群Ｇ是Ａｂｅｌ群当且仅当Ｇ_ｒ满足下列条件：（Ⅰ） Ｇ有一个幂自同构 ａ使得 ＣＧ（ａ）是一个初等 ＡｂｅｌＺ一群．（Ⅱ）Ｇ没有子群与２－群＜ａ,ｂ｜ａ~２~ｎ＝ｂ~２~ｍ＝１,ａ~ｂ＝ａ~（１＋２）~（ｎ－１）＞同构,其中ｎ≥３,ｎ≥ｍ．利用该结果,作者还证明若有限群Ｇ有一个幂自同构ａ使得Ｃ_Ｇ（ａ）是一个初等Ａｂｅｌ２－群,则Ｇ是幂零群     

Hexavalent symmetric graphs of order 9p

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 $9p$ for each prime $p$.     

三度边正则图的三个无限族

图X称为边正则图，若X的自同构群Aut(X)在X的边集上的作用是正则的．本文考察了三度边正则图与四度Cayley图的关系，给出了一个由四度Cayley图构造三度边正则图的方法，并且构造了边正则图的三个无限族．     

Hypohamiltonian Planar Cubic Graphs with Girth 5

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.     

Edge-primitive Cayley graphs on abelian groups and dihedral groups

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.     

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.     

Classification of a family of symmetric graphs with complete 2-arc-transitive quotients

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.     

A Local Analysis of Imprimitive Symmetric Graphs

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 G_B 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.     

On triconnected and cubic plane graphs on given point sets

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.     

Polygon-circle and word-representable graphs

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 W₅ 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.