Article ID Journal Published Year Pages File Type
6423650 Electronic Notes in Discrete Mathematics 2016 6 Pages PDF
Abstract

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.

Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Authors
, , , ,