摘要
讨论关于路Pn和圈Cn的幂图的消圈数.对于任意给定的次幂m,文中得出了路Pn和圈Cn的幂图的消圈数的准确值.另外,还给出了路Pn和圈Cn的幂图的最大导出树.
We study the decycling number for the family of m th power Gn^m of a graph G. We completely solved the problem of determining the decycling number of Pn^m and Cn^m for all m and n. Moreover, we find a vertex set T that yields a maximum induced tree in Pn^m and Cn^m.
出处
《福州大学学报（自然科学版）》
CAS
CSCD
北大核心
2007年第6期808-810,共3页
Journal of Fuzhou University(Natural Science Edition)
基金
福建省自然科学基金资助项目(Z0511017)
关键词
消圈数
幂图
路
圈
decycling number
power graph
path
cycle
