Sharp upper bounds on the spectral radius of the signless Laplacian matrix of a graph

A. Dilek Maden; Kinkar Ch Das; A. Sinan Çevik

doi:10.1016/j.amc.2012.11.039

Sharp upper bounds on the spectral radius of the signless Laplacian matrix of a graph

A. Dilek Maden, Kinkar Ch Das, A. Sinan Çevik

Department of Mathematics

Selcuk University

Research output: Contribution to journal › Article › peer-review

14 Scopus citations

Abstract

Let G=(V,E) be a simple connected graph. Denote by D(G) the diagonal matrix of its vertex degrees and by A(G) its adjacency matrix. Then the signless Laplacian matrix of G is Q(G)=D(G)+A(G). In this paper, we obtain some new and improved sharp upper bounds on the spectral radius ^q1(G) of the signless Laplacian matrix of a graph G.

Original language	English
Pages (from-to)	5025-5032
Number of pages	8
Journal	Applied Mathematics and Computation
Volume	219
Issue number	10
DOIs	https://doi.org/10.1016/j.amc.2012.11.039
State	Published - 2013

Keywords

Average degree of neighbors
Bounds
Degrees
Graph
Signless Laplacian
Spectral radius

Access to Document

10.1016/j.amc.2012.11.039

Cite this

@article{eec88b3b2a834222aff2af110cc99e59,

title = "Sharp upper bounds on the spectral radius of the signless Laplacian matrix of a graph",

abstract = "Let G=(V,E) be a simple connected graph. Denote by D(G) the diagonal matrix of its vertex degrees and by A(G) its adjacency matrix. Then the signless Laplacian matrix of G is Q(G)=D(G)+A(G). In this paper, we obtain some new and improved sharp upper bounds on the spectral radius q1(G) of the signless Laplacian matrix of a graph G.",

keywords = "Average degree of neighbors, Bounds, Degrees, Graph, Signless Laplacian, Spectral radius",

author = "\{Dilek Maden\}, A. and Das, \{Kinkar Ch\} and \{Sinan {\c C}evik\}, A.",

year = "2013",

doi = "10.1016/j.amc.2012.11.039",

language = "English",

volume = "219",

pages = "5025--5032",

journal = "Applied Mathematics and Computation",

issn = "0096-3003",

publisher = "Elsevier Inc.",

number = "10",

}

TY - JOUR

T1 - Sharp upper bounds on the spectral radius of the signless Laplacian matrix of a graph

AU - Dilek Maden, A.

AU - Das, Kinkar Ch

AU - Sinan Çevik, A.

PY - 2013

Y1 - 2013

N2 - Let G=(V,E) be a simple connected graph. Denote by D(G) the diagonal matrix of its vertex degrees and by A(G) its adjacency matrix. Then the signless Laplacian matrix of G is Q(G)=D(G)+A(G). In this paper, we obtain some new and improved sharp upper bounds on the spectral radius q1(G) of the signless Laplacian matrix of a graph G.

AB - Let G=(V,E) be a simple connected graph. Denote by D(G) the diagonal matrix of its vertex degrees and by A(G) its adjacency matrix. Then the signless Laplacian matrix of G is Q(G)=D(G)+A(G). In this paper, we obtain some new and improved sharp upper bounds on the spectral radius q1(G) of the signless Laplacian matrix of a graph G.

KW - Average degree of neighbors

KW - Bounds

KW - Degrees

KW - Graph

KW - Signless Laplacian

KW - Spectral radius

UR - https://www.scopus.com/pages/publications/84872141584

U2 - 10.1016/j.amc.2012.11.039

DO - 10.1016/j.amc.2012.11.039

M3 - Article

AN - SCOPUS:84872141584

SN - 0096-3003

VL - 219

SP - 5025

EP - 5032

JO - Applied Mathematics and Computation

JF - Applied Mathematics and Computation

IS - 10

ER -

Sharp upper bounds on the spectral radius of the signless Laplacian matrix of a graph

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this