And give exact values of bw ( g ) for four types of graphs . a upper bound of bw ( g ) for every connected simple graph g . the main results are as follows : propsition 2 . 2 if n > 6 , then bw ( pn ) = 1 在图弱控制的束缚数中,对树t给出其b _ w ( t )的上紧界;另对四类常见图类g给出b _ w ( g )的精确值。
In this paper , we establish some relations between the eigenvalues and matching number , diameter , and the number of quasi - pendant vertices of mixed graphs , which extend some known result of simple graphs on eigenvalues distribution 建立了混和图的特征值与匹配数、直径以及拟悬挂点数的关系,推广了简单图上若干关于特征值分布的结论
Abstract : in this paper we servey some recent trands of applications of the method of algebraic topology to simple graphs . some fundamental concepts are introduced with theorems . several new problems are proposed 文摘:我们从组合拓扑方法在图论的应用中,着重介绍与图有关的几种复形的近期研究动态,论述其中一些带基础性的问题,并提出一些可供研究的新问题
At last , we correct several mistakes in a paper written by pinar dundar . in chapter 3 , the concept of vertex - neighbor - scattering number of graphs is introduced , and the values of vertex - neighbor - scattering number of some simple graphs are given 第三章引入图的邻域离散数概念,给出几类基本图的邻域离散数值,并就树的邻域离散数进行较为深入的研究。
Let a graph g is a simple graph of order n . a graph of order n is called pancyclic if it contains cycles of every length l , 3 < l < n , and is called weakly pancyclic if it contains cycles of all lengths between its girth and circumference 设g是n阶简单图,如果对于任意的整数l : 3 l n , g中含有长度为l的圈,则称g为泛圈图;如果g中含有长度在围长和周长之间的所有圈,则称g是弱泛圈图。