摘要
证明了门槛图与度极大图是一类图的两种不同说法，同时用图的对角限制极左矩阵刻画这一类图的结构．
in the paper, we prove that threshold graphs and degree maximal graphs are two different statements of a class of graphs' and determine their structures in term of the off-diagonal left-most matrices.
出处
《数学进展》
CSCD
北大核心
2000年第4期341-344,共4页
Advances in Mathematics（China）
基金
National Natural Science Foundation of China
The Doctoral Program Foundation of National Education Department of China
关键词
门槛图
度极大图
对角限制极左矩阵
结构
threshold graph
degree maximal graph
off-diagonal left-most matrix
