Ara
Toplam kayıt 4, listelenen: 1-4
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. ...
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 ...
Semiregular trees with minimal Laplacian spectral radius
(Elsevier Inc, 2010-04-15)
A semiregular tree is a tree where all non-pendant vertices have the same degree. Among all semiregular trees with fixed order and degree, a graph with minimal (adjacency/Laplacian) spectral radius is a caterpillar. Counter ...