Extremal graphs for normalized Laplacian spectral radius and energy

Kinkar Ch Das, Shaowei Sun

Research output: Contribution to journalArticlepeer-review

17 Scopus citations

Abstract

Let G = (V, E) be a simple graph of order n and the normalized Laplacian eigenvalues ρ1 ≥ ρ2 ≥ ··· ≥ ρn−1 ≥ ρn = 0. The normalized Laplacian energy (or Randić energy) of G without any isolated vertex is defined as (Formula Present). In this paper, a lower bound on ρ1 of connected graph G (G is not isomorphic to complete graph) is given and the extremal graphs (that is, the second minimal normalized Laplacian spectral radius of connected graphs) are characterized. Moreover, Nordhaus-Gaddum type results for ρ1 are obtained. Recently, Gutman et al. gave a conjecture on Randić energy of connected graph [I. Gutman, B. Furtula, Ş. B. Bozkurt, On Randić energy, Linear Algebra Appl. 442 (2014) 50-57]. Here this conjecture for starlike trees is proven.

Original languageEnglish
Pages (from-to)237-253
Number of pages17
JournalElectronic Journal of Linear Algebra
Volume29
Issue number1
DOIs
StatePublished - 2015

Keywords

  • Nordhaus-Gaddum type results
  • Normalized Laplacian spread
  • Normalized Laplaican spectral radius
  • Randić energy
  • Vertex cover number

Fingerprint

Dive into the research topics of 'Extremal graphs for normalized Laplacian spectral radius and energy'. Together they form a unique fingerprint.

Cite this