摘要
令m,n是整数,且p=2m+n+2m+2n.本文研究了如何利用图论中有关点独立集的知识.来证明p=2m+n+2m+2n在何种情况下有最大、最小值.
Let m,nbe integers with p =2m +n +2m +2n. This paper studies how to make use of graph theory point of the independent set of knowledge, to explain the circumstances under which the maximum, minimum.
出处
《青海师专学报》
2009年第5期7-8,共2页
Journal of Qinghai Junior Teachers' College
关键词
数论
独立集
斐波那契数列
Number theory
independent set
Fibonacci Numbers