摘要
该文给出了图的控制数与2倍点线荫度之和及积的上界且所给出的界均可达到。
Abstract: Upper bounds for a(G) + 2vla(G) and a(G)vla(G) are proved .where 0(G) is the domination number and vla(G) the vertex linear arboricity number of a graph G ,and all bounds could be obtained.
出处
《江西师范大学学报（自然科学版）》
CAS
1995年第3期219-221,共3页
Journal of Jiangxi Normal University(Natural Science Edition)
关键词
控制数
点线荫度
上确界
图
简单图
the domination number.the vertices linear arboricity, the upper sharp bound
