Nodal geometry of graphs on surfaces

Yong Lin; Gábor Lippner; Dan Mangoubi; Shing Tung Yau

doi:10.3934/dcds.2010.28.1291

Nodal geometry of graphs on surfaces

Yong Lin^*, Gábor Lippner, Dan Mangoubi, Shing Tung Yau

^*Corresponding author for this work

Einstein Institute of Mathematics

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

2 Scopus citations

Abstract

We prove two mixed versions of the Discrete Nodal Theorem of Davies et. al. [3] for bounded degree graphs, and for three-connected graphs of fixed genus g. Using this we can show that for a three-connected graph satisfying a certain volume-growth condition, the multiplicity of the nth Laplacian eigenvalue is at most 2 [6(n - 1) + 15(2g - 2)]². Our results hold for any Schrodinger operator, not just the Laplacian.

Original language	English
Pages (from-to)	1291-1298
Number of pages	8
Journal	Discrete and Continuous Dynamical Systems
Volume	28
Issue number	3
DOIs	https://doi.org/10.3934/dcds.2010.28.1291
State	Published - Nov 2010

Keywords

Genus
Multiplicity of eigenvalues
Nodal domain

Access to Document

10.3934/dcds.2010.28.1291

Cite this

@article{352ee847fa35486e8e0bdceead0e9d0d,

title = "Nodal geometry of graphs on surfaces",

abstract = "We prove two mixed versions of the Discrete Nodal Theorem of Davies et. al. [3] for bounded degree graphs, and for three-connected graphs of fixed genus g. Using this we can show that for a three-connected graph satisfying a certain volume-growth condition, the multiplicity of the nth Laplacian eigenvalue is at most 2 [6(n - 1) + 15(2g - 2)]2. Our results hold for any Schrodinger operator, not just the Laplacian.",

keywords = "Genus, Multiplicity of eigenvalues, Nodal domain",

author = "Yong Lin and G{\'a}bor Lippner and Dan Mangoubi and Yau, {Shing Tung}",

year = "2010",

month = nov,

doi = "10.3934/dcds.2010.28.1291",

language = "אנגלית",

volume = "28",

pages = "1291--1298",

journal = "Discrete and Continuous Dynamical Systems",

issn = "1078-0947",

publisher = "American Institute of Mathematical Sciences",

number = "3",

}

TY - JOUR

T1 - Nodal geometry of graphs on surfaces

AU - Lin, Yong

AU - Lippner, Gábor

AU - Mangoubi, Dan

AU - Yau, Shing Tung

PY - 2010/11

Y1 - 2010/11

N2 - We prove two mixed versions of the Discrete Nodal Theorem of Davies et. al. [3] for bounded degree graphs, and for three-connected graphs of fixed genus g. Using this we can show that for a three-connected graph satisfying a certain volume-growth condition, the multiplicity of the nth Laplacian eigenvalue is at most 2 [6(n - 1) + 15(2g - 2)]2. Our results hold for any Schrodinger operator, not just the Laplacian.

AB - We prove two mixed versions of the Discrete Nodal Theorem of Davies et. al. [3] for bounded degree graphs, and for three-connected graphs of fixed genus g. Using this we can show that for a three-connected graph satisfying a certain volume-growth condition, the multiplicity of the nth Laplacian eigenvalue is at most 2 [6(n - 1) + 15(2g - 2)]2. Our results hold for any Schrodinger operator, not just the Laplacian.

KW - Genus

KW - Multiplicity of eigenvalues

KW - Nodal domain

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

U2 - 10.3934/dcds.2010.28.1291

DO - 10.3934/dcds.2010.28.1291

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:77955312373

SN - 1078-0947

VL - 28

SP - 1291

EP - 1298

JO - Discrete and Continuous Dynamical Systems

JF - Discrete and Continuous Dynamical Systems

IS - 3

ER -

Nodal geometry of graphs on surfaces

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this