摘要
以有向图G的顶点为元素,G的有向途径所对应的序列称为图型序列.本文讨论图型序列母函数的一些递归性质,主要包括割点定理,割边定理和删点公式.利用这些性质可以简化图型序列母函数的计算.
All sequences corresponding in one-to-one to directed walks in a directed graph G with element of points in G are called graphical sequences of G. This paper discusses some recurrence properties for generating function of graphical sequences, mainly including cut point theorem, cut edge theorem, delete point formula. Using there properties can simplify the computation of generating function of graphical sequences.
出处
《上海大学学报(自然科学版)》
CAS
CSCD
1995年第3期241-245,共5页
Journal of Shanghai University:Natural Science Edition
关键词
图论
母函数
图型序列
递归性质
graph theory
generating function. graphica sequences