科研之友
微信
新浪微博
Facebook
分享链接
摘要
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, 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.
- 出版日期2016-5
- 单位中国矿业大学（北京）
