Characteristic polynomials of graph coverings

被引：21
作者：
Feng, RQ [1 ]
Kwak, JH
Lee, J
机构：
[1] Peking Univ, LMAM, Sch Math Sci, Beijing 100871, Peoples R China
[2] Pohang Univ Sci & Technol, Dept Math, Pohang 790784, South Korea
[3] Yeungnam Univ, Dept Math, Kyongsan 712749, South Korea
来源：
BULLETIN OF THE AUSTRALIAN MATHEMATICAL SOCIETY | 2004年 / 69卷 / 01期
关键词：
D O I：
10.1017/S0004972700034328
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
In this note, a formula for the characteristic polynomial of any (regular or irregular) graph covering is described.
引用
收藏
页码：133 / 136
页数：4
相关论文
共 6 条
[1]  
Chae Y., 1993, J. Korean Math. Soc, V30, P229
[2]   GENERATING ALL GRAPH COVERINGS BY PERMUTATION VOLTAGE ASSIGNMENTS [J].
GROSS, JL ;
TUCKER, TW .
DISCRETE MATHEMATICS, 1977, 18 (03) :273-283
[3]   Characteristic polynomials of graph bundles having voltages in a dihedral group [J].
Kwak, JH ;
Kwon, YS .
LINEAR ALGEBRA AND ITS APPLICATIONS, 2001, 336 (1-3) :99-118
[4]  
KWAK JH, 1992, LINEAR MULTILINEAR A, V32, P61, DOI DOI 10.1080/03081089208818147
[5]   CHARACTERISTIC-POLYNOMIALS OF SOME GRAPH COVERINGS [J].
MIZUNO, H ;
SATO, I .
DISCRETE MATHEMATICS, 1995, 142 (1-3) :295-298
[6]  
SAGAN BE, 2001, SYMMETRIC GROUP
1