Konu "Algebraic connectivity" için FEF - Makale Koleksiyonu | Matematik Bölümü / Department of Mathematics listeleme
Toplam kayıt 8, listelenen: 1-8
-
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 ... -
Geometric representations and symmetries of graphs, maps and other discrete structures and applications in science
(Tübitak, 2015-09)Bu proje çalışmasının birinci amacı çizgelerin özdeğer ve özvektör yapılarını çizge özellik ve sabitleri ile ilişkilendirmektir. İkinci amacı biyoloji, bioinformatik, dinamik sistemler, haberleşme, kriptoloji ve sosyal ... -
Graphs of given order and size and minimum algebraic connectivity
(Elsevier Science Inc, 2012-04-01)The structure of connected graphs of given size and order that have minimal algebraic connectivity is investigated. It is shown that they must consist of a chain of cliques. Moreover, an upper bound for the number of maximal ... -
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 ... -
Network synchronization: Spectral versus statistical properties
(Elsevier B.V., 2006-12)We consider synchronization of weighted networks, possibly with asymmetrical connections. Focusing on causal relations rather than the observed correlations, we show that the synchronizability of networks cannot be directly ... -
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 ... -
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. ...