Toplam kayıt 3, listelenen: 1-3
Largest Eigenvalues of The Discrete P-Laplacian of Trees with Degree
(INT LINEAR ALGEBRA SOC, C/O JAMES WEAVER DEPT MATH & STATISTICS, 2009-03)
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 ...
Graphs with given degree sequence and maximal spectral radius
(ELECTRONIC JOURNAL OF COMBINATORICS, 2008-09-15)
We describe the structure of those graphs that have largest spectral radius in the class of all connected graphs with a given degree sequence. We show that in such a graph the degree sequence is non-increasing with respect ...
Algebraic connectivity and degree sequences of trees
(ELSEVIER SCIENCE INC, 2009-01-15)
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 ...