Loading...
Please wait, while we are loading the content...
Similar Documents
Maximizing the signless Laplacian spectral radius of graphs with given diameter or cut vertices
| Content Provider | Semantic Scholar |
|---|---|
| Author | Wang, Jianfeng Huang, Qiongxiang |
| Copyright Year | 2011 |
| Abstract | The signless Laplacian matrix of a graph is defined to be the sum of its adjacency matrix and degree matrix. Let be the set of all the connected graphs of order n and diameter d and 𝒢 n,k the set of all connected graphs with order n and k cut vertices. In this article, we determine the graphs that have the maximal signless Laplacian spectral radius and give the upper bounds of graphs in these two sets. |
| Starting Page | 733 |
| Ending Page | 744 |
| Page Count | 12 |
| File Format | PDF HTM / HTML |
| DOI | 10.1080/03081087.2010.499363 |
| Alternate Webpage(s) | http://math.sjtu.edu.cn/faculty/xiaodong/paper/2001/JCTB83-233-240-CITE/36-LAMA59-733-744.pdf |
| Alternate Webpage(s) | http://www.researchgate.net/profile/Jianfeng_Wang4/publication/232849161_Maximizing_the_signless_Laplacian_spectral_radius_of_graphs_with_given_diameter_or_cut_vertices/links/004635267430640b08000000.pdf |
| Alternate Webpage(s) | https://www.researchgate.net/profile/Jianfeng_Wang4/publication/232849161_Maximizing_the_signless_Laplacian_spectral_radius_of_graphs_with_given_diameter_or_cut_vertices/links/004635267430640b08000000.pdf |
| Alternate Webpage(s) | https://doi.org/10.1080/03081087.2010.499363 |
| Volume Number | 59 |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
