Graphic Sequences with a Realization Containing Intersecting Cliques  

作　　者：Jian Hua YIN Yan Fang DENG 

机构地区：[1]Department of Mathematics, College of Information Science and Technology, Hainan University

出　　处：《Acta Mathematica Sinica,English Series》2012年第2期405-416,共12页数学学报（英文版）

基　　金：Supported by National Natural Science Foundation of China(Grant No.10861006);SRF for ROCS,SEM

摘　　要：Let r ≥1, k ≥ 2 and Fm1,… k;r denote the most general definition of a friendship graph,Let r ≥1, k ≥ 2 and Fm1,… k;r denote the most general definition of a friendship graph,

关 键 词：Degree sequence potentially P-graphic sequence 

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