%0 Journal Article
%T 符号树的最小秩问题<br>The Minimum Rank Problem of Signed Trees
%A 牟谷芳
%A 黄捷
%A 钟琴&lt
%A br&gt
%A MOU Gu-fang
%A HUANG Jie
%A ZHONG Qin
%J 西南大学学报(自然科学版)
%D 2017
%R 10.13718/j.cnki.xdzk.2017.10.010
%X 对于符号模式矩阵<i>P</i>，可借助于它的伴随图来分析<i>P</i>的符号特征.本文研究了对称符号树和非对称符号树的最小秩问题，并将符号树转换为有向二部图，给出了计算对称符号树和非对称符号树的最小秩的算法.<br>For an sign pattern matrix P, we can analyze its sign characteristics with the help of its associated digraph. In this paper, we convert the signed trees into directed bipartite graphs to study the minimum rank problems of symmetric and asymmetric signed trees and provide an algorithm for computing the minimum ranks of symmetric and asymmetric signed trees
%K 符号矩阵
%K 有向二部图
%K 符号树
%K 最小秩&lt
%K br&gt
%K sign pattern matrix
%K directed bipartite graph
%K signed tree
%K minimum rank
%U http://xbgjxt.swu.edu.cn/jsuns/html/jsuns/2017/10/201710010.htm