Hostname: page-component-77c89778f8-swr86 Total loading time: 0 Render date: 2024-07-16T13:20:10.717Z Has data issue: false hasContentIssue false

Characteristic polynomials of graph coverings

Published online by Cambridge University Press:  17 April 2009

Rongquan Feng
Affiliation:
LMAM, School of Mathematical Sciences, Peking UniversityBeijing 100871, Peoples Republic of China, e-mail: fengrq@math.pku.edu.cn
Jin Ho Kwak
Affiliation:
Department of Mathematics, Pohang University of Science and Technology, Pohang, 790-784, Korea, e-mail: jinkwak@postech.ac.kr
Jaeun Lee
Affiliation:
Department of Mathematics, Yeungnam University, Kyongsan, 712-749, Korea, e-mail: julee@yu.ac.kr
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

In this note, a formula for the characteristic polynomial of any (regular or irregular) graph covering is described.

Type
Research Article
Copyright
Copyright © Australian Mathematical Society 2004

References

[1] Chae, Y., Kwak, J.H. and Lee, J., ‘Characteristic polynomials of some graph bundles’, J. Korean Math. Soc. 30 1993, 229249.Google Scholar
[2] Gross, J.L. and Tucker, T.W., ‘Generating all graph coverings by permutation voltage assignments’, Discrete Math. 18 1977, 273283.CrossRefGoogle Scholar
[3] Kwak, J.H. and Lee, J., ‘Characteristic polynomials of some graph bundles ’, Linear and Multilinear Algebra 32 1992, 6173.CrossRefGoogle Scholar
[4] Kwak, J.H. and Kwon, Y.S., ‘Characteristic polynomials of graph bundles having voltages in a dihedral group’, Linear Algebra Appl. 336 2001, 99118.CrossRefGoogle Scholar
[5] Mizuno, H. and Sato, I., ‘Characteristic polynomials of some graph coverings’, Discrete Math. 142 1995, 295298.CrossRefGoogle Scholar
[6] Sagan, B.E., The Symmetric group, (2nd edition) (Springer-Verlag, New York, 2001).CrossRefGoogle Scholar