Ordering graphs with small index and its application

Fuji Zhang; Zhibo Chen

doi:10.1016/S0166-218X(01)00302-X

Ordering graphs with small index and its application

Fuji Zhang
, Zhibo Chen

Penn State Greater Allegheny

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

20 Scopus citations

Abstract

We consider the problem of ordering connected graphs by index (the largest eigenvalue). The asymptotic ordering for the connected graphs with index less than √2+ √5 is determined. Its application to the study of acyclic Kekulean molecules with big HOMO-LUMO separation is also given.

Original language	English (US)
Pages (from-to)	295-306
Number of pages	12
Journal	Discrete Applied Mathematics
Volume	121
Issue number	1-3
DOIs	https://doi.org/10.1016/S0166-218X(01)00302-X
State	Published - Sep 15 2002

All Science Journal Classification (ASJC) codes

Discrete Mathematics and Combinatorics
Applied Mathematics

Access to Document

10.1016/S0166-218X(01)00302-X

Cite this

@article{1820f29e0a014a639a385c705f8be3e3,

title = "Ordering graphs with small index and its application",

abstract = "We consider the problem of ordering connected graphs by index (the largest eigenvalue). The asymptotic ordering for the connected graphs with index less than √2+ √5 is determined. Its application to the study of acyclic Kekulean molecules with big HOMO-LUMO separation is also given.",

author = "Fuji Zhang and Zhibo Chen",

year = "2002",

month = sep,

day = "15",

doi = "10.1016/S0166-218X(01)00302-X",

language = "English (US)",

volume = "121",

pages = "295--306",

journal = "Discrete Applied Mathematics",

issn = "0166-218X",

publisher = "Elsevier B.V.",

number = "1-3",

}

TY - JOUR

T1 - Ordering graphs with small index and its application

AU - Zhang, Fuji

AU - Chen, Zhibo

PY - 2002/9/15

Y1 - 2002/9/15

N2 - We consider the problem of ordering connected graphs by index (the largest eigenvalue). The asymptotic ordering for the connected graphs with index less than √2+ √5 is determined. Its application to the study of acyclic Kekulean molecules with big HOMO-LUMO separation is also given.

AB - We consider the problem of ordering connected graphs by index (the largest eigenvalue). The asymptotic ordering for the connected graphs with index less than √2+ √5 is determined. Its application to the study of acyclic Kekulean molecules with big HOMO-LUMO separation is also given.

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

UR - https://www.scopus.com/pages/publications/84867957001#tab=citedBy

U2 - 10.1016/S0166-218X(01)00302-X

DO - 10.1016/S0166-218X(01)00302-X

M3 - Article

AN - SCOPUS:84867957001

SN - 0166-218X

VL - 121

SP - 295

EP - 306

JO - Discrete Applied Mathematics

JF - Discrete Applied Mathematics

IS - 1-3

ER -

Ordering graphs with small index and its application

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this