Refined inertias of strongly connected orientations of the Petersen graph

详细信息    查看全文

• 作者：G.J. Culos^a ; ^{garrettc@uvic.ca" class="auth_mail" title="E-mail the corresponding author} ; D.D. Olesky^b ; ^{dolesky@cs.uvic.ca" class="auth_mail" title="E-mail the corresponding author} ; P. van den Driessche^a ; ^{pvdd@math.uvic.ca" class="auth_mail" title="E-mail the corresponding author}
• 关键词：15B35 ; 05C50
• 刊名：Linear Algebra and its Applications
• 出版年：2016
• 出版时间：15 October 2016
• 年：2016
• 卷：507
• 期：Complete
• 页码：322-343
• 全文大小：549 K

文摘

The 18 non-isomorphic strongly connected orientations of the Petersen graph give rise to matrix patterns in which nonzero entries can be taken to be strictly positive, of arbitrary sign, or of fixed sign. The allowed refined inertias, in which the number of zero eigenvalues is split from others on the imaginary axis, are considered for each such pattern. Each nonnegative pattern is shown to have unique refined inertia determined by the number of required zero eigenvalues. For zero–nonzero patterns, a complete list of allowed refined inertias is given for each orientation. One particular sign pattern is presented that allows only two distinct refined inertias out of a possible 161 for a sign pattern of order 10.