Improved upper and lower bounds for the spectral radius of digraphs

A. Dilek Güngör; Kinkar Ch Das

doi:10.1016/j.amc.2010.01.080

Improved upper and lower bounds for the spectral radius of digraphs

A. Dilek Güngör, Kinkar Ch Das

Department of Mathematics

Selcuk University

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

4 Scopus citations

Abstract

Let G be a digraph with n vertices and m arcs without loops and multiarcs. The spectral radius ρ (G) of G is the largest eigenvalue of its adjacency matrix. In this paper, sharp upper and lower bounds on ρ (G) are given. We show that some known bounds can be obtained from our bounds.

Original language	English
Pages (from-to)	791-799
Number of pages	9
Journal	Applied Mathematics and Computation
Volume	216
Issue number	3
DOIs	https://doi.org/10.1016/j.amc.2010.01.080
State	Published - 1 Apr 2010

Keywords

Bound
Digraph
Spectral radius

Access to Document

10.1016/j.amc.2010.01.080

Cite this

@article{81872fb791b345fbb6878cef529c0e3a,

title = "Improved upper and lower bounds for the spectral radius of digraphs",

abstract = "Let G be a digraph with n vertices and m arcs without loops and multiarcs. The spectral radius ρ (G) of G is the largest eigenvalue of its adjacency matrix. In this paper, sharp upper and lower bounds on ρ (G) are given. We show that some known bounds can be obtained from our bounds.",

keywords = "Bound, Digraph, Spectral radius",

author = "\{Dilek G{\"u}ng{\"o}r\}, A. and Das, \{Kinkar Ch\}",

year = "2010",

month = apr,

day = "1",

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

language = "English",

volume = "216",

pages = "791--799",

journal = "Applied Mathematics and Computation",

issn = "0096-3003",

publisher = "Elsevier Inc.",

number = "3",

}

TY - JOUR

T1 - Improved upper and lower bounds for the spectral radius of digraphs

AU - Dilek Güngör, A.

AU - Das, Kinkar Ch

PY - 2010/4/1

Y1 - 2010/4/1

N2 - Let G be a digraph with n vertices and m arcs without loops and multiarcs. The spectral radius ρ (G) of G is the largest eigenvalue of its adjacency matrix. In this paper, sharp upper and lower bounds on ρ (G) are given. We show that some known bounds can be obtained from our bounds.

AB - Let G be a digraph with n vertices and m arcs without loops and multiarcs. The spectral radius ρ (G) of G is the largest eigenvalue of its adjacency matrix. In this paper, sharp upper and lower bounds on ρ (G) are given. We show that some known bounds can be obtained from our bounds.

KW - Bound

KW - Digraph

KW - Spectral radius

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

U2 - 10.1016/j.amc.2010.01.080

DO - 10.1016/j.amc.2010.01.080

M3 - Article

AN - SCOPUS:77949484947

SN - 0096-3003

VL - 216

SP - 791

EP - 799

JO - Applied Mathematics and Computation

JF - Applied Mathematics and Computation

IS - 3

ER -

Improved upper and lower bounds for the spectral radius of digraphs

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this