The Signless Laplacian Spectral Radius of Tricyclic Graphs with $k$ Pendant Vertices
Received:August 10, 2010  Revised:January 13, 2011
Key Words: signless Laplacian spectral radius   tricyclic graph   pendant vertex.  
Fund Project:Supported by the National Natural Science Foundation of China (Grant Nos.10871204; 61170311) and the Fundamental Research Funds for the Central Universities (Grant No.09CX04003A).
Author NameAffiliation
Jingming ZHANG School of Mathematical Sciences, University of Electronic Science and Technology of China, Sichuan 611731, P. R. China
College of Mathematics and Computational Science, China University of Petroleum, Shandong 257061, P. R. China 
Jiming GUO College of Mathematics and Computational Science, China University of Petroleum, Shandong 257061, P. R. China 
Hits: 2977
Download times: 2938
Abstract:
      In this paper, we determine the unique graph with the largest signless Laplacian spectral radius among all the tricyclic graphs with $n$ vertices and $k$ pendant vertices.
Citation:
DOI:10.3770/j.issn:2095-2651.2012.03.003
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.