Some new bounds on the spectral radius of graphs

Kinkar Ch Das; Pawan Kumar

doi:10.1016/j.disc.2003.08.005

Some new bounds on the spectral radius of graphs

Kinkar Ch Das
, Pawan Kumar

Indian Institute of Technology Kharagpur

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

94 Scopus citations

Abstract

The eigenvalues of a graph are the eigenvalues of its adjacency matrix. This paper presents some upper and lower bounds on the greatest eigenvalue and a lower bound on the smallest eigenvalue.

Original language	English
Pages (from-to)	149-161
Number of pages	13
Journal	Discrete Mathematics
Volume	281
Issue number	1-3
DOIs	https://doi.org/10.1016/j.disc.2003.08.005
State	Published - 28 Apr 2004
Externally published	Yes

Keywords

Adjacency matrix
Graph
Spectral radius

Access to Document

10.1016/j.disc.2003.08.005

Cite this

@article{c29e682eceae46679c1ef0d7ac6e68a7,

title = "Some new bounds on the spectral radius of graphs",

abstract = "The eigenvalues of a graph are the eigenvalues of its adjacency matrix. This paper presents some upper and lower bounds on the greatest eigenvalue and a lower bound on the smallest eigenvalue.",

keywords = "Adjacency matrix, Graph, Spectral radius",

author = "Das, \{Kinkar Ch\} and Pawan Kumar",

year = "2004",

month = apr,

day = "28",

doi = "10.1016/j.disc.2003.08.005",

language = "English",

volume = "281",

pages = "149--161",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier B.V.",

number = "1-3",

}

TY - JOUR

T1 - Some new bounds on the spectral radius of graphs

AU - Das, Kinkar Ch

AU - Kumar, Pawan

PY - 2004/4/28

Y1 - 2004/4/28

N2 - The eigenvalues of a graph are the eigenvalues of its adjacency matrix. This paper presents some upper and lower bounds on the greatest eigenvalue and a lower bound on the smallest eigenvalue.

AB - The eigenvalues of a graph are the eigenvalues of its adjacency matrix. This paper presents some upper and lower bounds on the greatest eigenvalue and a lower bound on the smallest eigenvalue.

KW - Adjacency matrix

KW - Graph

KW - Spectral radius

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

U2 - 10.1016/j.disc.2003.08.005

DO - 10.1016/j.disc.2003.08.005

M3 - Article

AN - SCOPUS:1842563990

SN - 0012-365X

VL - 281

SP - 149

EP - 161

JO - Discrete Mathematics

JF - Discrete Mathematics

IS - 1-3

ER -

Some new bounds on the spectral radius of graphs

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this