Largest Eigenvalues of the Discrete p-Laplacian of Trees with Degree Sequences Paper

@inproceedings{Bykoglu2009LargestEO,
  title={Largest Eigenvalues of the Discrete p-Laplacian of Trees with Degree Sequences Paper},
  author={T{\"u}rker B{\'i}y{\'i}koglu and Marc Hellmuth and Josef Leydold},
  year={2009}
}
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 breadthfirst search where the vertex degrees are non-increasing. These trees are uniquely determined up to isomorphism. Moreover, their structure does not depend on p. 

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 12 references

The spectrum of the p-Laplacian and p-harmonic morphisms on graphs

  • Hiroshi Takeuchi
  • Illinois J. Math.,
  • 2003
1 Excerpt

Lectures on Graph Theory

  • O. Melnikov, R. I. Tyshkevich, V. A. Yemelichev, V. I. Sarvanov
  • B.I. Wissenschaftsverlag, Mannheim
  • 1994
1 Excerpt

Similar Papers

Loading similar papers…