Largest eigenvalues of the discrete p-laplacian of trees with degree sequences

Türker Biyikoglu; Marc Hellmuth; Josef Leydold

doi:10.57938/34dc0951-426b-4a2a-95fe-74e1bfd43256

Largest eigenvalues of the discrete p-laplacian of trees with degree sequences

Türker Biyikoglu, Marc Hellmuth, Josef Leydold

Publikation: Working/Discussion Paper › WU Working Paper

31 Downloads (Pure)

Abstract

We characterize trees that have greatest maximum p-Laplacian eigenvalue among all trees with a given degree sequence. We show that such extremal trees can be obtained by breadth-first search where the vertex degrees are non-increasing. These trees are uniquely determined up to isomorphism. Moreover, their structure does not depend on p.

Originalsprache	Englisch
DOIs	https://doi.org/10.57938/34dc0951-426b-4a2a-95fe-74e1bfd43256
Publikationsstatus	Veröffentlicht - 1 Mai 2009

Publikationsreihe

Reihe	Research Report Series / Department of Statistics and Mathematics
Nummer	85

WU Working Paper Reihe

Research Report Series / Department of Statistics and Mathematics

Zugriff auf Dokument

10.57938/34dc0951-426b-4a2a-95fe-74e1bfd43256Lizenz: Nicht angegeben

DocumentEndgültige, publizierte Fassung, 157 KBLizenz: Nicht angegeben

Verfügbarkeit prüfen

Katalog der Universitätsbibliothek

1 Originalbeitrag in Fachzeitschrift

Largest eigenvalues of the discrete p-Laplacian of trees with degree sequences
Biyikoglu, T., Hellmuth, M. & Leydold, J., 2009, in: Electronic Journal of Linear Algebra. 18, S. 202 - 210
Publikation: Wissenschaftliche Fachzeitschrift › Originalbeitrag in Fachzeitschrift › Forschung › Begutachtung

Zitat

@techreport{34dc0951426b4a2a95fe74e1bfd43256,

title = "Largest eigenvalues of the discrete p-laplacian of trees with degree sequences",

abstract = "We characterize trees that have greatest maximum p-Laplacian eigenvalue among all trees with a given degree sequence. We show that such extremal trees can be obtained by breadth-first search where the vertex degrees are non-increasing. These trees are uniquely determined up to isomorphism. Moreover, their structure does not depend on p.",

author = "T{\"u}rker Biyikoglu and Marc Hellmuth and Josef Leydold",

year = "2009",

month = may,

day = "1",

doi = "10.57938/34dc0951-426b-4a2a-95fe-74e1bfd43256",

language = "English",

series = "Research Report Series / Department of Statistics and Mathematics",

number = "85",

type = "WorkingPaper",

}

TY - UNPB

T1 - Largest eigenvalues of the discrete p-laplacian of trees with degree sequences

AU - Biyikoglu, Türker

AU - Hellmuth, Marc

AU - Leydold, Josef

PY - 2009/5/1

Y1 - 2009/5/1

N2 - We characterize trees that have greatest maximum p-Laplacian eigenvalue among all trees with a given degree sequence. We show that such extremal trees can be obtained by breadth-first search where the vertex degrees are non-increasing. These trees are uniquely determined up to isomorphism. Moreover, their structure does not depend on p.

AB - We characterize trees that have greatest maximum p-Laplacian eigenvalue among all trees with a given degree sequence. We show that such extremal trees can be obtained by breadth-first search where the vertex degrees are non-increasing. These trees are uniquely determined up to isomorphism. Moreover, their structure does not depend on p.

U2 - 10.57938/34dc0951-426b-4a2a-95fe-74e1bfd43256

DO - 10.57938/34dc0951-426b-4a2a-95fe-74e1bfd43256

M3 - WU Working Paper

T3 - Research Report Series / Department of Statistics and Mathematics

BT - Largest eigenvalues of the discrete p-laplacian of trees with degree sequences

ER -

Largest eigenvalues of the discrete p-laplacian of trees with degree sequences

Abstract

Publikationsreihe

WU Working Paper Reihe

Zugriff auf Dokument

Verfügbarkeit prüfen

Andere Versionen dieses Inhalts

Largest eigenvalues of the discrete p-Laplacian of trees with degree sequences

Zitat