完全r-部图的均匀着色

A graph is equitably k-colorable if its vertices can be partitioned into k independent sets of as near equal sizes as possible. In this paper, we determine a sufficient and necessary condition for which a complete r-partite graph is equitably k-colorable. From this result, we can provide another way to prove some previous results.     

农村客运网络的图论实践和探索

按照城乡运输一体化的总体思路,为实现农村村村通客车的目标,针对农村客运线路繁杂,节点众多的特点,本文应用图论最短树,H AM ILTON回路,进行网络优化,并对其算法进行了探索.     

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.     

计算机代数系统应用研究

计算机代数是近三十年发展起来的关于数学、计算机及人工智能方面的交叉学科,是数学发展的前沿学科,应用广泛.应用计算机代数系统的强大的符合运算功能以及该系统提供的控制语句,对一类弱非线性系统的有效渐近展开式解进行了研究,不但能使其自动求解,而且自动实现在平衡点附近降低微分方程阶数和实行中心流形方法,并试图解决了G r bner基在图论中关于连通图的最短路径问题.     

Non-bipartite Graphs with Third Largest Laplacian Eigenvalue Less Than Three

All bipartite graphs whose third largest Laplacian eigenvalue is less than 3 have been characterized by Zhang. In this paper, all connected non-bipartite graphs with third largest Laplacian eigenvalue less than three are determined.     

ARC-TRANSITIVE CUBIC GRAPHS OF ORDER 4_p

In this paper, a complete classification of arc-transitive cubic graphs of order 4p is given.     

关于完美全图的Hamilton—性

设Ｇ（Ｖ，Ｅ）是一个简单图，而Ｖ（Ｔ（Ｇ））＝Ｖ（Ｇ）∪Ｅ（Ｇ），Ｅ（Ｔ（Ｇ））＝｛ｙｚ│ｙ，ｚ相邻或相关，ｙ，ｚ∈Ｖ（Ｇ）∪Ｅ（Ｇ）｝，则称Ｔ（Ｇ）为Ｇ（Ｖ，Ｅ）的全图；若对Ｇ的每一导出子图Ｈ，有ｘ（Ｈ）＝ｗ（Ｈ），则称Ｇ是完美的，其中ｘ（Ｈ），ｗ（Ｈ）分别表示Ｈ的色数和团数，本文给了完美全图是Ｈａｍｉｌｔｏｎ图的充分必要条件。     

Total Dominating Set Games

1 DefinitionsIn this paper we discuss cooperative cost games that arise from total domination problems on graphs. A cooperative cost game (Г) = (N,c) consists of a player set N = {1,2,…,n} and a characteristic function c : 2N→R, where for each subset S(？)N, c(S) represents the cost incurred by the coalition of players in S. The central problem in cooperative game is     

Restricted Edge Connectivity of Binary Undirected Kautz Graphs

A restricted edge cut is an edge cut of a connected graph whose removal resultsin a disconnected graph without isolated vertices. The size of a minimum restricted edge cutof a graph G is called its restricted edge connectivity, and is denoted by λ′(G). Let ξ(G) bethe minimum edge degree of graph G. It is known that λ′(G) ≤ξ(G) if G contains restrictededge cuts. Graph G is called maximal restricted edge connected if the equality holds in thethe preceding inequality. In this paper, undirected Kautz graph UK(2, n) is proved to bemaximal restricted edge connected if n ≥ 2.     

几类可升分解的图

Ａｌａｖｉ等人在文献［１］中定义了图的一种新分解，即“升分解”，并且猜想：任意有正数条边的图都可升分解。本文证明了下面三类图可升分解，并得到了一些有意义的推论。１设Ｒｎ是一个至多含有ｎ个顶点和至多含有ｎ条边的图，Ｋｎ－Ｒｎ可升分解（ｎ≥５）；２对称图可升分解；３对称图Ｇ的混合积（Ｇ；ｋ）可升分解。