摘要
本文主要讨论了图的下完美邻域数 ,并给出了θ(G) =γ(G)的充分必要条件 ,并讨论了一些特殊图类的下完美邻域数的上界 ,特别对于树采用了对所有点分层的方法进行了较细致的讨论 ,给出了紧上界θ(T)≤ [n3] .
This paper mainly discusses the lower perfect neighborhood number of graphs, gives the sufficient and necessary conditions of θ(G) = γ(G), and discusses the upper bound of the lower perfect neighborhood number of some special graphs. Especially, we discuss it on tree in details and give the tight upper bound θ(T)≤?n3 by using the method of dividing the vertices of tree into levels.
出处
《数学杂志》
CSCD
北大核心
2003年第2期161-165,共5页
Journal of Mathematics
基金
教育部科学技术研究重点项目 (批准号 :0 2 13 9)
关键词
下完美邻域数
上界
the lower perfect neighborhood number
the upper bound
