On the Largest Eigenvalue of Signless Laplacian Matrix of a Graph
Received:April 12, 2007  Revised:March 08, 2008
Key Words: signless Laplacian matrix   characteristic polynomial   largest eigenvalue.  
Fund Project:the National Natural Science Foundation of China (No.10871204); Graduate Innovation Foundation of China University of Petroleum (No.S2008-26).
Author NameAffiliation
TAN Shang Wang Department of Applied Mathematics, China University of Petroleum, Shandong 257061, China 
WANG Xing Ke Department of Applied Mathematics, China University of Petroleum, Shandong 257061, China 
Hits: 3799
Download times: 3298
Abstract:
      The signless Laplacian matrix of a graph is the sum of its diagonal matrix of vertex degrees and its adjacency matrix. Li and Feng gave some basic results on the largest eigenvalue and characteristic polynomial of adjacency matrix of a graph in 1979. In this paper, we translate these results into the signless Laplacian matrix of a graph and obtain the similar results.
Citation:
DOI:10.3770/j.issn:1000-341X.2009.03.001
View Full Text  View/Add Comment