关于弦图的团序列  

ON THE CLIQUE SEQUENCE OF CHORDAL GRAPHS

作　　者：吴举林[1] 

机构地区：[1]青岛大学数学系

出　　处：《山东师范大学学报（自然科学版）》1991年第1期32-35,共4页Journal of Shandong Normal University(Natural Science)

摘　　要：设G=(V,E)是一个有限无向简单图,C_k是G中具有k个点的完备子图的数目。序列(C_1,C_2,…)称为图G的团序列。本文给出了整数序列是弦图的团序列的充分必要条件、两个弦图有相同的团序列的充分必要条件和弦图k连通的充分必要条件。Let G be a finite, undirected, simple graph, C_k be the number of complete subgraphs of G on K vertices. The sequence (c_1, c_2, c_3, c_4,) is called the clique sequence of G. This paper gives necessary and sufficient conditions for: (1) An integer sequence is the clique sequence of a chordal graph. (2) Two chordal graphs have the same clique sequence. (3) A chordal graph is k--connected.

关 键 词：弦图 色多项式 团序列 

分 类 号：O157.5[理学—数学]