摘要
记G(n)为所有n阶连通简单单圈图所构成的集合。主要讨论了G(n)按其度距离从小到大进行排序的问题,并确定了该序的前5个图和相应的度距离。其中极小图是由n阶星图的2个悬挂点之间添加一条边所得到的图R(3)n=3n2-3n-6。n,且D′R(3)
Let \$G(n)\$ be the collective of all the simple connective graphs with \$n\$ vertices. The problem on the ordering graphs in \$G(n)\$ by their degree distance is investigated in this paper, and the first five graphs in this order and the corresponding degree distance of these graphs are determined. The first graph \$R^((3))_n\$ in this order is the graph obtained from the star graph by adding an edge between two vertices of degree 1, and \$D′R^((3))_n=3n^2-3n-6.
出处
《福州大学学报（自然科学版）》
CAS
CSCD
2004年第6期664-668,共5页
Journal of Fuzhou University(Natural Science Edition)
基金
福州大学发展基金资助项目(2003-xy-12).
关键词
单圈图
度距离
序
graph
degree distance
ordering
