Unicyclic Graphs with a Perfect Matching Having Signless Laplacian Eigenvalue Two
Received:May 12, 2016  Revised:July 29, 2016
Key Word: Signless Laplacian matrix   unicyclic graph   multiplicity  
Fund ProjectL:Supported by the National Natural Science Foundation of China (Grant Nos.61379021; 11471077), the Natural Science Foundation of Fujian Province (Grant Nos.2015J01018; 2016J01673), the Project of Fujian Education Department (Grant No.JZ160455), Research Fund of Minnan Normal University (Grant No.MX1603), Faculty Research Grant of Hong Kong Baptist University.
Author NameAffiliation
Jianxi LI School of Mathematics and Statistics, Minnan Normal University, Fujian 363000, P. R. China 
Wai Chee SHIU Department of Mathematics, Hong Kong Baptist University, Kowloon Tong, Hong Kong, P. R. China 
Hits: 1933
Download times: 7270
      In this paper, a necessary and sufficient condition for a unicyclic graph with a perfect matching having signless Laplacian eigenvalue $2$ is deduced.
View Full Text  View/Add Comment  Download reader