符号树的最小秩问题  

The Minimum Rank Problem of Signed Trees

作　　者：牟谷芳[1] 黄捷[2] 钟琴[3] MOU Gu-fang HUANG Jie ZHONG Qina(College of Mathematics and Information Science, Leshan Normal University, Leshan Sichuan 614000 School of Mathematical Sciences, University of Electronic Science and Technology of China, Chengdu Department of Mathematics, Jinjiang College of Sichuan University, Pengshan Sichuan 620860, China China, 611731, China)

机构地区：[1]乐山师范学院数学与信息科学学院,四川乐山614000 [2]电子科技大学数学科学学院,成都611731 [3]四川大学锦江学院,四川彭山620860

出　　处：《西南大学学报（自然科学版）》2017年第10期69-74,共6页Journal of Southwest University(Natural Science Edition)

基　　金：国家自然科学基金项目(11401081);四川省教育厅资助科研项目(17ZB0193);乐山师范学院资助科研项目(Z1521)

摘　　要：对于符号模式矩阵P,可借助于它的伴随图来分析P的符号特征.本文研究了对称符号树和非对称符号树的最小秩问题,并将符号树转换为有向二部图,给出了计算对称符号树和非对称符号树的最小秩的算法.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.

关 键 词：符号矩阵 有向二部图 符号树 最小秩 

分 类 号：O157.6[理学—数学]