Algebraic Connectivity and Degree Sequences of Trees

التفاصيل البيبلوغرافية
العنوان: Algebraic Connectivity and Degree Sequences of Trees
المؤلفون: Biyikoglu, Türker, Leydold, Josef
بيانات النشر: Department of Statistics and Mathematics, WU Vienna University of Economics and Business, 2008.
سنة النشر: 2008
المجموعة: Wirtschaftsuniversität Wien
مصطلحات موضوعية: MSC 05C75, 05C05, 05C50, algebraic connectivity / graph Laplacian / tree / degree sequence / Fiedler vector / Dirichlet matrix
الوصف: We investigate the structure of trees that have minimal algebraic connectivity among all trees with a given degree sequence. We show that such trees are caterpillars and that the vertex degrees are non-decreasing on every path on non-pendant vertices starting at the characteristic set of the Fiedler vector. (author´s abstract)
Series: Research Report Series / Department of Statistics and Mathematics
Original Identifier: oai:epub.wu-wien.ac.at:epub-wu-01_dfe
نوع الوثيقة: Paper
وصف الملف: application/pdf
اللغة: English
Relation: http://epub.wu.ac.at/782/
الاتاحة: http://epub.wu.ac.at/782/1/document.pdf
رقم الانضمام: edsndl.VIENNA.oai.epub.wu.wien.ac.at.epub.wu.01.dfe
قاعدة البيانات: Networked Digital Library of Theses & Dissertations