摘要
一个图G被称为斐波那契图 ,如果可以给它的项点分配非负整数 ,使得由分配给每条边的端点的数之和所得到的边的值能够排成一个斐波那契数列 1,1,2 ,3,5 ,8,13,2 1,34…Fn.我们证明了路、圈及完全图KP 是斐波那契图的充要条件 .
A graph G is said to be Fibonacci graph, if its vertices can be assigned nonnegative integers, then the values of the edges, obtained as the sums of the numbers assigned to their ends vertices, can be arranged in the Fibonacci progression 1,1,2,3,5,8,13,…,F n. In this paper circle C n (n≠3k+1) and complete graph that neccessary and sufficient condition for the path、k p(p≥4) is Fibonacci graph are obtained.
出处
《北京建筑工程学院学报》
2004年第3期67-68,共2页
Journal of Beijing Institute of Civil Engineering and Architecture
关键词
斐波那契数列
斐波那契图
路
圈
Fibonacci progression
Fibonacci graph
path
cycle
