A Characterization of Graphs with Rank No More Than 5

• 作者: Haicheng Ma Xiaohua Liu
• 来源期刊: 应用数学(英文)
• 学科: 数学
• 关键词: GRAPH MATRIX RANK NULLITY
• 年，卷（期）: 2017,（1）
• 页码范围: 26-34
• 页数: 9页
• 分类号: O1

摘要

The rank of a graph is defined to be the rank of its adjacency matrix. In this paper, the Matlab was used to explore the graphs with rank no more than 5;the performance of the proposed method was compared with former methods, which is simpler and clearer;and the results show that all graphs with rank no more than 5 are characterized.