期刊文献+

A Characterization of Graphs with Rank No More Than 5 被引量:1

A Characterization of Graphs with Rank No More Than 5
下载PDF
导出
摘要 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. 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.
出处 《Applied Mathematics》 2017年第1期26-34,共9页 应用数学(英文)
关键词 GRAPH MATRIX RANK NULLITY Graph Matrix Rank Nullity
  • 相关文献

同被引文献6

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部