摘要
设G是简单图。记ρ(G)为覆盖图G所需路数的最小值。本文证明了ρ(G)≤[2n/3];且若G是连通图,则ρ(G)≤[3n/5]。
Let G be a simple graph. Denote ρ(G) for the minimal number of paths nessesary to cover graph G. We prove that ρ(G)≤[2n/3]; if G is restricted to be connected, then ρ(G)≤[3n/5]
出处
《内蒙古大学学报（自然科学版）》
CAS
CSCD
1990年第2期173-177,共5页
Journal of Inner Mongolia University：Natural Science Edition
基金
This Drojocc iS supported by the Natural Science Fund of Nci Mongol
关键词
图
覆兽
路覆盖数
连通图
covering of a graph
the path number of a graph
