The linear guessing number of undirected graphs

被引:2
|
作者
Chang, Gerard Jennhwa [1 ,2 ,3 ]
Feng, Keqin [4 ]
Huang, Liang-Hao [5 ]
Lu, Mei [4 ]
机构
[1] Natl Taiwan Univ, Dept Math, Taipei 10617, Taiwan
[2] Natl Taiwan Univ, Taida Inst Math Sci, Taipei 10617, Taiwan
[3] Natl Ctr Theoret Sci, Taipei Off, Hsinchu, Taiwan
[4] Tsinghua Univ, Dept Math Sci, Beijing 100084, Peoples R China
[5] Acad Sinica, Res Ctr Informat Technol Innovat, Taipei 115, Taiwan
基金
中国国家自然科学基金;
关键词
Linear guessing number; Undirected graph; Network coding;
D O I
10.1016/j.laa.2014.02.010
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
This paper investigates linear guessing number introduced by Riis in connection with the network coding theory. This paper establishes properties of linear guessing number on undirected graphs. In particular, lower and upper bounds for linear guessing number are established. Finally, linear guessing numbers of product graphs are investigated. (C) 2014 Elsevier Inc. All rights reserved.
引用
收藏
页码:119 / 131
页数:13
相关论文
共 44 条