The signless Laplacian spectral radius of graphs with given diameter

Authors

  • Feng, Li-Hua
  • Yu, Gui-Hai

Abstract

In this paper, we show that among all connected graphs of order n with diameter D, the graph GD* has maximal signless Laplacian spectral radius, where GD*, is obtained from Kn-D V K̄2 by identifying one endvertex of path with length l 1 at u and one endvertex of path with length l2 at v, respectively, where u, v are two vertices of K̄2, |l1 - l22| ≤ 1.

Published

2010-09-09

How to Cite

Feng, Li-Hua, & Yu, Gui-Hai. (2010). The signless Laplacian spectral radius of graphs with given diameter. Utilitas Mathematica, 83. Retrieved from https://utilitasmathematica.com/index.php/Index/article/view/673

Issue

Vol. 83 (2010): Volume 83, 2010

Section

Articles

Citation Check

Most read articles by the same author(s)

Obs.: This plugin requires at least one statistics/report plugin to be enabled. If your statistics plugins provide more than one metric then please also select a main metric on the admin's site settings page and/or on the journal manager's settings pages.