On the largest eigenvalue of the distance matrix of a bipartite graph

Kinkar Ch Das

On the largest eigenvalue of the distance matrix of a bipartite graph

Kinkar Ch Das

Department of Mathematics

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

13 Scopus citations

Abstract

We obtain the lower and upper bounds on the largest eigenvalue of the distance matrix of a connected bipartite graph and characterize those graphs for which these bounds are best possible.

Original language	English
Pages (from-to)	667-672
Number of pages	6
Journal	Match
Volume	62
Issue number	3
State	Published - 2009

Cite this

@article{d2d59a5eed9e49b1b7b61d64964dde27,

title = "On the largest eigenvalue of the distance matrix of a bipartite graph",

abstract = "We obtain the lower and upper bounds on the largest eigenvalue of the distance matrix of a connected bipartite graph and characterize those graphs for which these bounds are best possible.",

author = "Das, \{Kinkar Ch\}",

year = "2009",

language = "English",

volume = "62",

pages = "667--672",

journal = "Match",

issn = "0340-6253",

publisher = "University of Kragujevac, Faculty of Science",

number = "3",

}

TY - JOUR

T1 - On the largest eigenvalue of the distance matrix of a bipartite graph

AU - Das, Kinkar Ch

PY - 2009

Y1 - 2009

N2 - We obtain the lower and upper bounds on the largest eigenvalue of the distance matrix of a connected bipartite graph and characterize those graphs for which these bounds are best possible.

AB - We obtain the lower and upper bounds on the largest eigenvalue of the distance matrix of a connected bipartite graph and characterize those graphs for which these bounds are best possible.

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

M3 - Article

AN - SCOPUS:77949356214

SN - 0340-6253

VL - 62

SP - 667

EP - 672

JO - Match

JF - Match

IS - 3

ER -

On the largest eigenvalue of the distance matrix of a bipartite graph

Abstract

Other files and links

Fingerprint

Cite this