On the Laplacian, signless Laplacian and normalized Laplacian characteristic polynomials of a graph

Ji-Ming Guo; Jianxi Li; Wai Chee Shiu

Czechoslovak Mathematical Journal (2013)

  • Volume: 63, Issue: 3, page 701-720
  • ISSN: 0011-4642

Abstract

top
The Laplacian, signless Laplacian and normalized Laplacian characteristic polynomials of a graph are the characteristic polynomials of its Laplacian matrix, signless Laplacian matrix and normalized Laplacian matrix, respectively. In this paper, we mainly derive six reduction procedures on the Laplacian, signless Laplacian and normalized Laplacian characteristic polynomials of a graph which can be used to construct larger Laplacian, signless Laplacian and normalized Laplacian cospectral graphs, respectively.

How to cite

top

Guo, Ji-Ming, Li, Jianxi, and Shiu, Wai Chee. "On the Laplacian, signless Laplacian and normalized Laplacian characteristic polynomials of a graph." Czechoslovak Mathematical Journal 63.3 (2013): 701-720. <http://eudml.org/doc/260668>.

@article{Guo2013,
abstract = {The Laplacian, signless Laplacian and normalized Laplacian characteristic polynomials of a graph are the characteristic polynomials of its Laplacian matrix, signless Laplacian matrix and normalized Laplacian matrix, respectively. In this paper, we mainly derive six reduction procedures on the Laplacian, signless Laplacian and normalized Laplacian characteristic polynomials of a graph which can be used to construct larger Laplacian, signless Laplacian and normalized Laplacian cospectral graphs, respectively.},
author = {Guo, Ji-Ming, Li, Jianxi, Shiu, Wai Chee},
journal = {Czechoslovak Mathematical Journal},
keywords = {Laplacian matrix; signless Laplacian matrix; normalized Laplacian matrix; characteristic polynomial; Laplacian matrix; signless Laplacian matrix; normalized Laplacian matrix; characteristic polynomial},
language = {eng},
number = {3},
pages = {701-720},
publisher = {Institute of Mathematics, Academy of Sciences of the Czech Republic},
title = {On the Laplacian, signless Laplacian and normalized Laplacian characteristic polynomials of a graph},
url = {http://eudml.org/doc/260668},
volume = {63},
year = {2013},
}

TY - JOUR
AU - Guo, Ji-Ming
AU - Li, Jianxi
AU - Shiu, Wai Chee
TI - On the Laplacian, signless Laplacian and normalized Laplacian characteristic polynomials of a graph
JO - Czechoslovak Mathematical Journal
PY - 2013
PB - Institute of Mathematics, Academy of Sciences of the Czech Republic
VL - 63
IS - 3
SP - 701
EP - 720
AB - The Laplacian, signless Laplacian and normalized Laplacian characteristic polynomials of a graph are the characteristic polynomials of its Laplacian matrix, signless Laplacian matrix and normalized Laplacian matrix, respectively. In this paper, we mainly derive six reduction procedures on the Laplacian, signless Laplacian and normalized Laplacian characteristic polynomials of a graph which can be used to construct larger Laplacian, signless Laplacian and normalized Laplacian cospectral graphs, respectively.
LA - eng
KW - Laplacian matrix; signless Laplacian matrix; normalized Laplacian matrix; characteristic polynomial; Laplacian matrix; signless Laplacian matrix; normalized Laplacian matrix; characteristic polynomial
UR - http://eudml.org/doc/260668
ER -

References

top
  1. Berge, C., Principles of Combinatorics. Mathematics in Science and Engineering vol. 72, Academic Press New York (1971). (1971) MR0270922
  2. Butler, S., 10.1080/03081080902722741, Linear Multilinear Algebra 58 (2010), 387-390. (2010) Zbl1187.05046MR2663439DOI10.1080/03081080902722741
  3. Chung, F. R. K., Spectral Graph Theory. Regional Conference Series in Mathematics 92, American Mathematical Society Providence (1997). (1997) MR1421568
  4. Grone, R., Merris, R., 10.1007/BF01787574, Graphs Comb. 6 (1990), 229-237. (1990) Zbl0735.05054MR1081197DOI10.1007/BF01787574
  5. Guo, J., 10.1016/j.laa.2005.02.031, Linear Algebra Appl. 404 (2005), 251-261. (2005) Zbl1066.05085MR2149662DOI10.1016/j.laa.2005.02.031
  6. Guo, J.-M., On the Laplacian spectral radius of trees with fixed diameter, Linear Algebra Appl. 419 (2006), 618-629. (2006) Zbl1118.05063MR2277992
  7. Guo, J.-M., 10.1016/j.disc.2007.10.044, Discrete Math. 308 (2008), 5702-5711. (2008) Zbl1189.05085MR2459389DOI10.1016/j.disc.2007.10.044
  8. Liu, Y., Liu, Y., 10.1016/j.disc.2009.01.010, Discrete Math. 309 (2009), 4315-4325. (2009) Zbl1189.05087MR2519167DOI10.1016/j.disc.2009.01.010
  9. Schwenk, A. J., Computing the characteristic polynomial of a graph, Graphs and Combinatorics. Proceedings of the Capital Conference on Graph Theory and Combinatorics at the George Washington University, June 18-22, 1973. Lecture Notes in Mathematics 406 R. A. Bari et al. Springer Berlin (1974), 153-172. (1974) Zbl0308.05121MR0387126
  10. Shao, J. Y., Guo, J. M., Shan, H. Y., The ordering of trees and connected graphs by algebraic connectivity, Linear Algebra Appl. 428 (2008), 1421-1438. (2008) Zbl1134.05063MR2388629
  11. Yuan, X. Y., Shao, J. Y., Zhang, L., 10.1016/j.dam.2007.08.014, Discrete Appl. Math. 156 (2008), 757-769. (2008) Zbl1137.05047MR2397220DOI10.1016/j.dam.2007.08.014
  12. Zhang, X. D., Ordering trees with algebraic connectivity and diameter, Linear Algebra Appl. 427 (2007), 301-312. (2007) Zbl1125.05067MR2351361

NotesEmbed ?

top

You must be logged in to post comments.