Return to search

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

Trees that have greatest maximum p-Laplacian eigenvalue among all trees with a given degree sequence are characterized. It is shown 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.

Identiferoai:union.ndltd.org:DRESDEN/oai:qucosa:de:qucosa:32144
Date08 November 2018
CreatorsBiyikoglu, Türker, Hellmuth, Marc, Leydold, Josef
Source SetsHochschulschriftenserver (HSSS) der SLUB Dresden
LanguageEnglish
Detected LanguageEnglish
Typeinfo:eu-repo/semantics/publishedVersion, doc-type:article, info:eu-repo/semantics/article, doc-type:Text
Rightsinfo:eu-repo/semantics/openAccess
Relation1081-3810

Page generated in 0.0018 seconds