single graph

A sufficient condition to decide a simple graph with a complete subgraph;

简单图含有完全子图的一个充分条件

The maximum possible number of edges in a simple graph in which at most two cycles have the same length;

各等长圈数不超过2的简单图的最大边数

The Adjoint Polynomials of the Simple Graphs(p≤6);

简单图(p≤6)的伴随多项式

BerGe proposed a suspicion about 4- reGular Graphs : [1] 4- reGular simple Graphs contain 3- reGular sub-Graphs.

BerGe提出了关于正则图的一个猜想:4正则简单图都包含3正则子图[1]。

Partition of vertex-disjoint paths in simple graphs;

给定一个阶为n的简单图G=(V;E),其中α(G)≥4,及1个正整数k≥2,考虑在领域条件下G划分成k条点不交路的问题,并得到下面的结果:对G中任何4个独立点x1,x2,y1,y2,满足领域条件,｜NG(x1)∪NG(x2)｜+｜NG(y1)∪NG(y2)｜≥n-k-1,则要么G能划分成k条点不交的路,要么G属于一类例外图G′。