Ranks of Regular Graphs Under Certain Unary Operations

Charles R.Garner,Jr.1, George J.Davis2, Gayla S.Domke2
1Rockdale Magnet School for Science and Technology Conyers, GA 30094
2Department of Mathematics and Statistics Georgia State University, Atlanta, GA 30303

Abstract

We consider the rank of the adjacency matrix of some classes of regular graphs that are transformed under certain unary operations. In particular, we study the ranks of the subdivision graph, the connected cycle graph, the connected subdivision graph, and the total graph of the following families of graphs: cycles, complete graphs, complete bipartite and multipartite graphs, circulant graphs of degrees three and four, and some Cartesian graph products.