摘要
单图G是符号可逆图,如果它的邻接矩阵A(G)的逆矩阵A ̄(-1)(G)是某个符号图H的邻接矩阵。符号图S是平衡图,如果它的每一个圈都包含偶数条负边。构造了一类符号可逆图,并给出了这类图的符号逆图是平衡图的充要条件。
Agraph G is called signed invertible if its adjacency matrix A(G)has an inverse A  ̄(-1) (G) which is the adjacency matrix of some signed graph H.Asigned graph S is balanced if each of its cycles contains even negative edges. We now construct a class of signed invertible graphs,and obtain the condition of equivalence of their signed inverse graphs′being balanced graphs.
出处
《北京邮电大学学报》
EI
CAS
CSCD
1995年第4期71-75,共5页
Journal of Beijing University of Posts and Telecommunications
关键词
图
符号可逆图
平衡图
网络图论
graph(mathematics )/signed invertble graph
balanced graph