Abstract (EN):
Let DS be a weighted digraph of order n with a subdigraph S of order k, M(DS) its adjacency weight matrix and ¿(DS) its spectral radius. We consider the class Ck of weighted digraphs of order k and we study the preorder in Ck given by DS¿¿DS if and only if ¿(DS¿)¿¿(DS). We obtain that this order is equivalent to the entry-wise order M(DS¿)¿M(DS). Several points of view are taken, under varying regularity conditions, and k polynomial conditions for the comparison are presented. © 2016 Elsevier B.V.
Language:
English
Type (Professor's evaluation):
Scientific