Sizes and transmissions of digraphs with a given clique number

被引:2
作者
Huang, Zejun [1 ]
Lin, Huiqiu [2 ]
机构
[1] Hunan Univ, Coll Math & Econometr, Changsha 410082, Hunan, Peoples R China
[2] E China Univ Sci & Technol, Dept Math, Shanghai 200237, Peoples R China
基金
中国博士后科学基金;
关键词
Clique number; Digraph; Size; Transmission; DOMINATION NUMBER; GRAPHS; DISTANCES; EDGES; SUM;
D O I
10.1007/s10878-015-9850-5
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
We determine the maximum and minimum sizes of digraphs with a given clique numbers as well as the digraphs that attain these extremal sizes. The maximum and minimum transmissions of connected digraphs with given clique numbers are also determined.
引用
收藏
页码:1642 / 1649
页数:8
相关论文
共 11 条