A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
The eigenvalues of the adjacency matrix of a graph form the spectrum of the graph. The multiplicity of the eigenvalue zero in the spectrum of a graph is called nullity of the graph. Fan and Qian (2009) obtained the nullity set of n-vertex bipartite graphs and characterized the bipartite graphs with nullity n − 4 and the regular n-vertex bipartite graphs with nullity n − 6. In this paper, we study similar problem for a class of tripartite graphs. As observed the nullity problem in tripartitedoi:10.1515/ausi-2016-0006 fatcat:ofaxpgrjmvb6xntefyrqi4nbwa