http://dx.doi.org/10.1016/j.laa.2012.04.016">
 

Document Type

Journal Article

Department/Unit

Department of Mathematics

Title

The smallest Laplacian spectral radius of graphs with a given clique number

Language

English

Abstract

The Laplacian spectral radius of a graph G is the largest eigenvalue of its Laplacian matrix. In this paper, the first three smallest values of the Laplacian spectral radii among all connected graphs with clique number ω are obtained. © 2012 Elsevier Inc. All rights reserved.

Keywords

Clique number, Laplacian characteristic polynomial, Laplacian spectral radius

Publication Date

2012

Source Publication Title

Linear Algebra and its Applications

Volume

437

Issue

4

Start Page

1109

End Page

1122

Publisher

Elsevier

ISSN (print)

00243795

This document is currently not available here.

Share

COinS