The Laplacian polynomial of complete multipartite graphs

Guo Peng Zhao, Li Gong Wang

Research output: Contribution to journalArticlepeer-review

2 Scopus citations

Abstract

The existence problem of Laplacian integral graphs is studied. Let A(G) denotes the adjacency matrix of graph G with n vertices and D(G) denotes the degree diagonal matrix of graph G. The Laplacian matrix of graph G is L(G) =D(G)-A(G). By studying the Laplacian characteristic polynomial of the complete multipartite graph Kp1, p2⋯ pr' it is obtained that all the complete multipartite graphs Kp1.P2⋯,Pr are Laplacian integral.

Original languageEnglish
Pages (from-to)243-245
Number of pages3
JournalFangzhi Gaoxiao Jichukexue Xuebao
Volume24
Issue number2
StatePublished - Jun 2011

Keywords

  • Complete multipartite graph
  • Laplacian integral
  • Laplacian polynomial

Fingerprint

Dive into the research topics of 'The Laplacian polynomial of complete multipartite graphs'. Together they form a unique fingerprint.

Cite this