@article{a0b2629391144c0a9d8d4c5846197daf,
title = "Largest eigenvalues of the discrete p-Laplacian of trees with degree sequences",
abstract = "We characterize trees that have greatest maximum p-Laplacian eigen- value 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",
doi = "10.13001/1081-3810.1305",
language = "English",
volume = "18",
pages = "202 -- 210",
journal = "Electronic Journal of Linear Algebra",
issn = "1081-3810",
publisher = "International Linear Algebra Society",
}