论文部分内容阅读
单图Ｇ是符号可逆图，如果它的邻接矩阵Ａ（Ｇ）的逆矩阵Ａ￣（－１）（Ｇ）是某个符号图Ｈ的邻接矩阵。符号图Ｓ是平衡图，如果它的每一个圈都包含偶数条负边。构造了一类符号可逆图，并给出了这类图的符号逆图是平衡图的充要条件。
The single graph G is a sign reversible graph if the inverse matrix A (-1) (G) of its adjacency matrix A (G) is the adjacency matrix of a certain symbol graph H. The symbol S is a balanced graph if every one of its rings contains an even number of negative edges. A class of symbolic reversible graphs is constructed, and the necessary and sufficient conditions for the symbolic graphs of such graphs to be balanced graphs are given.