节点文献
图的路覆盖数的上界
The Upper Bounds for the Path Number of A Graph
【摘要】 设G是简单图。记ρ(G)为覆盖图G所需路数的最小值。本文证明了ρ(G)≤[2n/3];且若G是连通图,则ρ(G)≤[3n/5]。
【Abstract】 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]
【基金】 This Drojocc iS supported by the Natural Science Fund of Nci Mongol
- 【文献出处】 内蒙古大学学报(自然科学版) ,Acta Scientiarum Naturalium Universitatis Neimongol , 编辑部邮箱 ,1990年02期
- 【下载频次】17