拟阵的可去圈

本首先用拟阵语言将图论的新概念定义成了拟阵的新概念，然后用拟阵语言将Goddyn和Heuevl所得的图论上的新结果平移成了拟阵的新结果，最后用拟阵的方法对它们给出了新的证明。     

锁具装箱问题中锁具总数的图论算法

本文为１９９４年全国大学生数学建模竞赛Ｂ题（锁具装箱）中关于锁具总数的求解提供一种简便易行的图论算法．只需具备最基本的图论知识，即可掌握该算法，而运用该算法，计算量将比现有各种求解算法少得多     

图论发展的一些动态

L.Euler 1736年发表了讨论K~nigsberge七桥问题的著名论文,这是图论的第一篇论文,图论由此发端。D.K~nig 1936年发表了经典著作,这是图论的第一本专著,图论由此成为数学的一个独立学科。从1936年图论发端到1936年图论成为独立学科,整整经历了两个世纪200年,根据N.Biggs,E.K.Lloyd和R.J.Wilson附录3,这200年间共发表有关图论的论文248篇,平均每年仅1,2篇,可见这两个世纪的发展速度是相当缓慢的。     

离散事件动态系统研究中图论方法的某些应用

因为许多离散生产过程都可以用离散事件系统描述，所以离散事件动态系统有很强的实用背景，例如柔性制造系统，因此，受到国内外的广泛注意和重视，进行深入研究，已获得一些很重要的理论结果．本文试图用图论的观点和方法，对离散事件动态系统的某些重要结果予以注释和新的证明，并探讨图论在该领域研究中的进一步应用．     

组合拓扑方法在组合学和图论中的应用

本文介绍组合拓扑方法在图论和组合学中的应用，探索一些新的离散问题和连续问题的关系，介绍目前有关这方面的新结果及发展动向。本文主要介绍同调理论在图论中的应用，与图有关的复形及性质，不动点定理在离散问题中的应用等。文中提出了一些新结果及可供研究的新问题。     

校园最佳游览路线问题的数学模型分析

将某高校的校园示意图转化为赋权连通图，求得该连通图的邻接矩阵，利用Floyd算法及图论软件包构造一个最短路径矩阵，得到一个赋权完全图，将求校园最佳游览路线问题归结为图论中的最佳推销员回路问题，建立混合整数线性规划模型，并利用优化软件求得最优解．从而解决了校园开放日游览计划中提出的关于校园最佳游览路线和校园游览车最优配置问题．     

图的点可区别的分数边染色数

讨论了图的点可区别的边染色数在分数图论的拓展,采用分数图论中超图的a:b-染色方法,证明了邻点可区别的分数边染色数与分数边染色数的等价性,同时进一步推导出经典图论中几类点可区别的边染色数概念如κ-D(β)-点可区别的边染色数、点可区别的边染色数和边染色数也在分数图论的拓展下具有等价性.     

数学竞赛中的图论问题

0.引言国内外历届数学竞赛,多次出现一种生动诱人且十分刁难的试题类型,代数、几何和三角等中学数学的传统内容对它无可奈何,从而成为考生丢分的要害。原来,这类题目出自图论。只要我们懂得一些图论的基本概念,它们就会变得相当顺手,甚至成为整个试卷最易得分的部分。 本文介绍图论的基本概念,并从国内外数学竞赛试题中挑选若干典型试题为例,用图论     

极值图论与度序列

本文简要概述极值图论与度序列的最新研究进展，同时提出了一些有待进一步解决的问题和猜想．     

应用图论分析与最优化理论来数据挖掘大规模水牛普里昂蛋白结构数据

图论、最优化理论显然在蛋白质结构的研究中大有用场. 首先, 调查/回顾了研究蛋白质结构的所有图论模型. 其后, 建立了一个图论模型: 让蛋白质的侧链来作为图的顶点, 应用图论的诸如团、 $k$-团、 社群、 枢纽、聚类等概念来建立图的边. 然后, 应用数学最优化的现代摩登数据挖掘算法/方法来分析水牛普里昂蛋白结构的大数据. 成功与令人耳目一新的数值结果将展示给朋友们.     

无线传感网络节点定位的三边扩展法

针对无线传感网络中难以解决的基于欧氏距离的多跳定位问题,通过引入刚性图与整体刚性图的概念,应用刚性框架理论和图论知识,将多跳定位的首要问题——唯一可解性问题转化成了整体刚性图的判定问题,同时给出了判定的充分必要条件,有效降低了刚性框架理论的分析复杂度.再采用三边扩展法逐步构建整体刚性图,不断扩大可定位节点的范围,实现确定网络中所有可定位节点位置的目的.     

A new model for Boolean algebra

This new model for set theory is a graph. It is similar in many ways to a Venn diagram or Karnaugh map, but it does not pose as a rival, merely as an alternative model which may be useful in some contexts. Defined with reference to the duality of lines and points, the graph is a fitting framework in which to display the rich duality of Boolean algebra.

In the first four sections the graph is developed as a natural embodiment of Boolean theory and it is hoped that it will be seen, not as a more computational device but as helpful for demonstrating Boolean theory. The second half of the article is devoted to practical applications. The graph can be applied (and has been applied in school teaching) extensively in set theory, in logic, in probability, in genetics and in switching circuits, but space does not allow the elaboration of all these in detail. So this article concentrates mainly on one of these applications, switching circuits. The graph is used to simplify and minimize logic circuits with techniques different from Karnaugh's and in some instances more comprehensive.     

Strategies of loop recombination in ciliates

The concept of breakpoint graph, known from the theory of sorting by reversal, has been successfully applied in the theory of gene assembly in ciliates. We further investigate its usage for gene assembly, and show that the graph allows for an efficient characterization of the possible orders of loop recombination operations (one of the three types of molecular operations that accomplish gene assembly) for a given gene during gene assembly. The characterization is based on spanning trees within a graph built upon the connected components in the breakpoint graph. We work in the abstract and more general setting of so-called legal strings.     

A closed graph theorem for order bounded operators

The closed graph theorem is one of the cornerstones of linear functional analysis in Fréchet spaces, and the extension of this result to more general topological vector spaces is a di?cult problem comprising a great deal of technical difficulty. However, the theory of convergence vector spaces provides a natural framework for closed graph theorems. In this paper we use techniques from convergence vector space theory to prove a version of the closed graph theorem for order bounded operators on Archimedean vector lattices. This illustrates the usefulness of convergence spaces in dealing with problems in vector lattice theory, problems that may fail to be amenable to the usual Hausdorff-Kuratowski-Bourbaki concept of topology.     

On weighted directed graphs

The study of a mixed graph and its Laplacian matrix have gained quite a bit of interest among the researchers. Mixed graphs are very important for the study of graph theory as they provide a setup where one can have directed and undirected edges in the graph. In this article we present a more general structure, namely the weighted directed graphs and supply appropriate generalizations of several existing results for mixed graphs related to singularity of the corresponding Laplacian matrix. We also prove many new combinatorial results relating the Laplacian matrix and the graph structure.     

Analogues of Cayley graphs for topological groups

We define for a compactly generated totally disconnected locally compact group a graph, called a rough Cayley graph, that is a quasi-isometry invariant of the group. This graph carries information about the group structure in an analogous way to the ordinary Cayley graph for a finitely generated group. With this construction the machinery of geometric group theory can be applied to topological groups. This is illustrated by a study of groups where the rough Cayley graph has more than one end and a study of groups where the rough Cayley graph has polynomial growth. Supported by project J2245 of the Austrian Science Fund (FWF) and be an IEF Marie Curie Fellowship of the Commission of the European Union.     

Spanning subgraphs with specified valencies

The author has published a necessary and sufficient condition for a finite looplesses graph to have a spanning subgraph with a specified positive valency at each vertex (see [8,9]). In the present paper it is contended that the condition can be made more useful as a tool of graph theory by imposing a maximality condition.     

Spanning subgraphs with specified valencies

The author has published a necessary and sufficient condition for a finite loopless graph to have a spanning subgraph with a specified positive valency at each vertex (see [8], [9]). In the present paper it is contended that the condition can be made more useful as a tool of graph theory by imposing a maximality condition.     

Non-abelian GKM theory

We describe a generalization of GKM theory for actions of arbitrary compact connected Lie groups. To an action satisfying the non-abelian GKM conditions we attach a graph encoding the structure of the non-abelian 1-skeleton, i.e., the subspace of points with isotopy rank at most one less than the rank of the acting group. We show that the algebra structure of the equivariant cohomology can be read off from this graph. In comparison with ordinary abelian GKM theory, there are some special features due to the more complicated structure of the non-abelian 1-skeleton.