Unicyclic Graphs with a Perfect Matching Having Signless Laplacian Eigenvalue Two
Received:May 12, 2016  Revised:July 29, 2016
Key Words: Signless Laplacian matrix   unicyclic graph   multiplicity  
Fund Project: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: 3236
Download times: 8473
Abstract:
      In this paper, a necessary and sufficient condition for a unicyclic graph with a perfect matching having signless Laplacian eigenvalue $2$ is deduced.
Citation:
DOI:10.3770/j.issn:2095-2651.2017.04.001
View Full Text  View/Add Comment  
  Copyright © Journal of Mathematical Research with Applications
Sponsored by：Dalian University of Technology, China Society for Industrial and Applied Mathematics
Address：No.2 Linggong Road, Ganjingzi District, Dalian City, Liaoning Province, P. R. China , Postal code ：116024
Service Tel：86-411-84707392 Email：jmre@dlut.edu.cn
Designed by Beijing E-tiller Co.,Ltd.
Due to security factors, early browsers cannot log in. It is recommended to log in with IE10, IE11, Google, Firefox, and 360 new browsers.