Valeurs propres négatives des graphes réguliers

Wen Ching Winnie Li

doi:10.1016/S0764-4442(01)02155-3

Valeurs propres négatives des graphes réguliers

Translated title of the contribution: On negative eigenvalues of regular graphs

Wen Ching Winnie Li

Mathematics

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

7 Scopus citations

Abstract

In this Note we prove that if {G_n} is a sequence of connected k-regular graphs in which the length of odd cycles approaches infinity as n→∞, then the limsup of the smallest eigenvalue of G_n greater than -k is at most -2k-1 as n tends to infinity.

Translated title of the contribution	On negative eigenvalues of regular graphs
Original language	French
Pages (from-to)	907-912
Number of pages	6
Journal	Comptes Rendus de l'Academie des Sciences - Series I: Mathematics
Volume	333
Issue number	10
DOIs	https://doi.org/10.1016/S0764-4442(01)02155-3
State	Published - Nov 2001

All Science Journal Classification (ASJC) codes

Mathematics(all)

Access to Document

10.1016/S0764-4442(01)02155-3

Cite this

@article{8a2db60b45224c16a8095a8c0349dab5,

title = "Valeurs propres n{\'e}gatives des graphes r{\'e}guliers",

abstract = "In this Note we prove that if {Gn} is a sequence of connected k-regular graphs in which the length of odd cycles approaches infinity as n→∞, then the limsup of the smallest eigenvalue of Gn greater than -k is at most -2k-1 as n tends to infinity.",

author = "Li, {Wen Ching Winnie}",

year = "2001",

month = nov,

doi = "10.1016/S0764-4442(01)02155-3",

language = "French",

volume = "333",

pages = "907--912",

journal = "Comptes Rendus Mathematique",

issn = "1631-073X",

publisher = "Elsevier Masson",

number = "10",

}

TY - JOUR

T1 - Valeurs propres négatives des graphes réguliers

AU - Li, Wen Ching Winnie

PY - 2001/11

Y1 - 2001/11

N2 - In this Note we prove that if {Gn} is a sequence of connected k-regular graphs in which the length of odd cycles approaches infinity as n→∞, then the limsup of the smallest eigenvalue of Gn greater than -k is at most -2k-1 as n tends to infinity.

AB - In this Note we prove that if {Gn} is a sequence of connected k-regular graphs in which the length of odd cycles approaches infinity as n→∞, then the limsup of the smallest eigenvalue of Gn greater than -k is at most -2k-1 as n tends to infinity.

UR - http://www.scopus.com/inward/record.url?scp=0347117535&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0347117535&partnerID=8YFLogxK

U2 - 10.1016/S0764-4442(01)02155-3

DO - 10.1016/S0764-4442(01)02155-3

M3 - Article

AN - SCOPUS:0347117535

VL - 333

SP - 907

EP - 912

JO - Comptes Rendus Mathematique

JF - Comptes Rendus Mathematique

SN - 1631-073X

IS - 10

ER -

Valeurs propres négatives des graphes réguliers

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this