几类强协调图与非强协调图

证明了风车图K4n3(n∈自然数)及其它几类强协调图,并给出了统一的强协调值标号,最后证明了Kn-e(n≥6)是非强协调图.     

一类几乎唯一泛圈图

设G是阶为n的简单Hamilton图．若存在m(3(?)m相似文献   

关于几乎唯一泛圈图

设G是阶为n的简单Hamilton图．若存在m(3(?)m＜n)使对每个l∈{3,4,…,n} -{m},G恰有一个长为l的圈且不含长为m的圈,则称G是几乎唯一泛圈图,用(?)k表示具有n k条边和恰有1/2(k 1)(k 2)个圈的简单H图的集合,用(?)_k~*表示具有n k条边恰有2~k k个圈的简单外可平面H图的集合,本文确定了(?)_k和(?)_k~*中所有几乎唯一泛圈图,并证明这些图都是简单MCD图,本文还构造了50个含有同胚于K_4的子图的几乎唯一泛圈图,并提出了若干问题和猜想。     

偶图中过给定独立边集的圈

这里考虑的一切图均为简单的,以V(G),E(G)分别表示图G的节点集和边集。设H是G的子图,x∈V(H),用d_H(x)表示H中与节点x相邻节点的个数。如果e=(x,y)∈E(H),x,y是e的端点,则让d_H(e)=d_H(x)+d_H(y)。设A、B是V(G)的两个节点不交的子集,用E(A:B)表示G中一端在A中另一端在B中边的个数。设M是G     

由圈得到的一类优美图

本文证明了ｎ个顶点的圈增加若干条弦所得到的图优美．     

平面可弦图的子式障碍

证明了平面可弦图的子式障碍恰由Ｋ５，Ｋ３，３，Ｋ２，２，２和Ｋ２×Ｃ５这四个图构成     

关于图与圈之并图的圈唯一性

Farrell[1]引进图 G 的圈多项式 c(G;■).文[6]猜测:轮形图 W_8是圈唯一的.本文中我们证明上述猜测为真且讨论了某些图与圈之并图的圈唯一性.     

简单图圈基长度的最大值

图的圈基是图的一个重要结构,一个圈基的长度是该圈基中所有圈的长度之和,本讲座了简单图的圈基长度的最大值,得到了如下结果：设基圈数为k,顶点数为n的简单图的圈基长度最大值为C^*,i)若k≥4且n ≥k 2时,C^*-kn;Ⅱ）若k=2,3,则对任意n≥4,C^*=kn-1,Ⅲ）若n(n≥5）为奇数,则对k(k≥4）的所有可能值,C^*=kn。     

Harmonious order of graphs

We consider the following generalization of the concept of harmonious graphs. Given a graph G=(V,E) and a positive integer t≥|E|, a function is called a t-harmonious labeling of G if is injective for t≥|V| or surjective for t<|V|, and for all distinct edges vw,xy∈E(G). Then the smallest possible t such that G has a t-harmonious labeling is named the harmonious order of G. We determine the harmonious order of some non-harmonious graphs, such as complete graphs K_n (n≥5), complete bipartite graphs K_m,n (m,n>1), even cycles C_n, some powers of paths , disjoint unions of triangles nK₃ (n even). We also present some general results concerning harmonious order of the Cartesian product of two given graphs or harmonious order of the disjoint union of copies of a given graph. Furthermore, we establish an upper bound for harmonious order of trees.     

Relative Length of Longest Paths and Cycles in Graphs

For a graph G, let diff(G) = p(G) − c(G), where p(G) and c(G) denote the orders of a longest path and a longest cycle in G, respectively. Let G be a 3-connected graph of order n. In the paper, we give a best-possible lower bound to σ₄(G) to assure diff(G) ≤ 1. The result settles a conjecture in J. Graph Theory 37 (2001), 137–156.     

Neighborhood Unions and Hamilton Cycles in Bipartite Graphs

ＮｅｉｇｈｂｏｒｈｏｏｄＵｎｉｏｎｓａｎｄＨａｍｉｌｔｏｎＣｙｃｌｅｓｉｎＢｉｐａｒｔｉｔｅＧｒａｐｈｓＬｉｕＹｉｐｉｎｇ（刘一平）；ＷｕＺｈｅｎｇｓｈｅｎｇ（吴正声）（ＤｅｐａｒｔｍｅｎｔｏｆＭａｔｈｅｍａｔｉｃｓ，ＮａｎｊｉｎｇＮｏｒｍａｌＵｎｉ...     

On Edge-Colored Graphs Covered by Properly Colored Cycles

We characterize edge-colored graphs in which every edge belongs to some properly colored cycle. We obtain our result by applying a characterization of 1-extendable graphs. Received: April, 2003     

带弦有向圈的2级合成

考察带一条弦的有向圈的2级合成图,得到了它们强连通的充要条件,这些结果被用于判定布尔矩阵组合合成的本原性。     

Edge choosability of planar graphs without 5-cycles with a chord

Let G be a plane graph having no 5-cycles with a chord. If either Δ≥6, or Δ=5 and G contains no 4-cycles with a chord or no 6-cycles with a chord, then G is edge-(Δ+1)-choosable, where Δ denotes the maximum degree of G.     

Construction of Hamiltonian Cycles in Layered Cubic Planar Graphs

 In this paper, a class of cubic planar graphs is given that have Hamiltonian cycles that can be constructed in linear time. A member of this class is called a layered cubic planar graph, and consists of a sequence of cycles C ₀ ,C ₁ ,…,C _n such that each pair of successive cycles, C _i , C _i+1 , is joined by a matching. The cycles can be pictured as concentric circles, and the edges of the matchings as radial line segments between successive circles. The subgraph bounded by two successive cycles forms a layer; each face in layer i is incident to a fixed number k _i+1 of edges in the matching in layer i+1. The problem that initially motivated this work is that of identifying classes of convex cubic polyhedra that can be easily edge three-colored. Received: September 21, 1998 Final version received: July 21, 1999     

Even Cycles in Graphs with Many Odd Cycles

It will be shown that if G is a graph of order n which contains a triangle, a cycle of length n or n−1 and at least cn odd cycles of different lengths for some positive constant c, then there exists some positive constant k=k(c) such that G contains at least kn ^1/6 even cycles of different lengths. Other results on the number of even cycle lengths which appear in graphs with many different odd length cycles will be given. Received: October 15, 1997     

S3上阿诺德弦猜想中的变分方法

本文使用变分方法证明了三维标准切触球的标准勒让德扭结，至少存在一个弦连结适应于标准切触结构的任何选定切触形式，这部分证明了著名的阿诺德弦猜想。