A characterization of signed planar graphs with rank at most 4
A characterization of signed planar graphs with rank at most 4
复制标题
DOI：
10.1080/03081087.2015.1057137
复制
发表时间：
2016-05
影响因子：
1.1
通讯作者：
Fenglei Tian;Dengyin Wang;Min-Hui Zhu
中科院分区：
文献类型：
--
作者：
Fenglei Tian;Dengyin Wang;Min-Hui Zhu
一个符号图由一个底层图和一个符号函数组成，符号函数分配一个符号的每条边，可以是正的，也可以是负的。符号图的邻接矩阵定义为，其中是基础图的邻接矩阵。的秩被定义为的秩。本文主要刻画了秩为或的符号图，并刻画了秩为4的符号平面图。
A signed graph consists of an underlying graph and a sign function , which assigns each edge of a sign, either positive or negative. The adjacency matrix of a signed graph is defined as with , where is the adjacency matrix of the underlying graph . The rank of is defined to be the rank of . In this paper, we characterize the signed graphs with rank or , and characterize the signed planar graphs with rank 4.