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.
| Identifer | oai:union.ndltd.org:DRESDEN/oai:qucosa:de:qucosa:32144 |
| Date | 08 November 2018 |
| Creators | Biyikoglu, Türker, Hellmuth, Marc, Leydold, Josef |
| Source Sets | Hochschulschriftenserver (HSSS) der SLUB Dresden |
| Language | English |
| Detected Language | English |
| Type | info:eu-repo/semantics/publishedVersion, doc-type:article, info:eu-repo/semantics/article, doc-type:Text |
| Rights | info:eu-repo/semantics/openAccess |
| Relation | 1081-3810 |
Page generated in 0.0785 seconds