Author(s)

Haicheng Ma^*, Danyang Li, Chengling Xie

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

We called graph G non-singular if adjacency matrix A (G) of G is non-singular. A connected graph with n vertices and n-1, n and n+1 edges are called the tree, the unicyclic graph and the bicyclic graph. Respectively, as we all know, each connected bicyclic graph must contain ∞(a,s,b) or θ(p,l,q) as the induced subgraph. In this paper, by using three graph transformations which do not change the singularity of the graph, the non-singular trees, unicyclic graphs and bicyclic graphs are obtained.

Adjacency Matrix, Non-Singular, Rank, Nullity

Ma, H. , Li, D. and Xie, C. (2020) Non-Singular Trees, Unicyclic Graphs and Bicyclic Graphs. Applied Mathematics, 11, 1-7. doi: 10.4236/am.2020.111001.