The Bases and Base Set of Primitive Symmetric Loop-Free Signed Digraphs  

作　　者：Shuyong YI Lihua YOU Yuhan WU 

机构地区：[1]School of Mathematical Science,South China Normal University,Guangdong 510631,P.R.China

出　　处：《Journal of Mathematical Research with Applications》2012年第3期313-326,共14页数学研究及应用（英文版）

基　　金：Supported by the National Natural Science Foundation of China(Grant Nos.10901061;11071088);the Zhujiang Technology New Star Foundation of Guangzhou(Grant No.2011J2200090)

摘　　要：In this paper, we study the bases and base sets of primitive symmetric loop-free （generalized） signed digraphs on n vertices. We obtain sharp upper bounds of the bases, and show that the base sets of the classes of such digraphs are （2, 3,..., 2n - 1}. We also give a new proof of an important result obtained by Cheng and Liu.In this paper, we study the bases and base sets of primitive symmetric loop-free （generalized） signed digraphs on n vertices. We obtain sharp upper bounds of the bases, and show that the base sets of the classes of such digraphs are （2, 3,..., 2n - 1}. We also give a new proof of an important result obtained by Cheng and Liu.

关 键 词：PRIMITIVE signed digraph SYMMETRIC non-powerful base. 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构] TP393.098[自动化与计算机技术—计算机科学与技术]