A Characterization of Graphs with Rank No More Than 5 - Applied Mathematics

AM > Vol.8 No.1, January 2017

A Characterization of Graphs with Rank No More Than 5 ()

HTML XML

Download as PDF (Size: 668KB) PP. 26-34

DOI: 10.4236/am.2017.81003 6,022 Downloads 7,715 Views Citations

Author(s)

Haicheng Ma, Xiaohua Liu

Affiliation(s)

Department of Mathematics, Qinghai Nationalities University, Xining, China.

ABSTRACT

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.

KEYWORDS

Graph, Matrix, Rank, Nullity

Share and Cite:

Ma, H. and Liu, X. (2017) A Characterization of Graphs with Rank No More Than 5. Applied Mathematics, 8, 26-34. doi: 10.4236/am.2017.81003.

Journals Menu