Ara
Toplam kayıt 3, listelenen: 1-3
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 ...
Some notes on spectra of cographs
(Charles Babbage Res Ctr, 2011-07)
A cograph is a P-4-free graph. We first give a short proof of the fact that 0 (-1) belongs to the spectrum of a connected cograph (with at least two vertices) if and only if it contains duplicate (resp. coduplicate) vertices. ...
Largest eigenvalues of the discrete p-Laplacian of trees with degree sequences
(Int Linear Algebra Soc, 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 ...