Determinant Of Theta Type Bicyclic Graphs Using Incycle Vertices
Abstract
The determinant of the adjacency matrix of the graph is generally called the determinant of the graph. Finding
the determinant of graphs has been a topic of interest in algebraic graph theory. Many methods of reduction and formulae have been devised over the years. One of the formulae given by F. Harary, to find the determinant of the graph requires finding all the sesquivalent spanning subgraphs of a graph. The concept of incycle vertices depends on sesquivalent spanning subgraphs. We have used incycle vertices to find the determinant of bicyclic graphs with a common edge in this paper.
References
2. F. Harary, “The Determinant of the adjacency matrix of a graph”, SIAM Rev. 4, 1961, 202–210.
3. Gong S-C., Zhang, J-L., and Xu G-H, “On the determinant of the distance matrix of a bicyclic graph”, arXiv:1308.2281v1, 2013.
4. Li, Jianxi & Chang, An & Shiu, Wai Chee, “On the nullity of bicyclic graphs”, MATCH - Communications in Mathematical and in Computer Chemistry, 2008.
5. Ma, H., Li, D. and Xie, C, “Non-Singular Trees, Unicyclic Graphs and Bicyclic Graphs”, Applied Mathematics, 2019, 1-7.
6. Supot Sookyang, Srichan Arworn, Piotr Wojtylak, “Characterizations of Non-Singular Cycles, Path and Trees”, Thai Journal of Mathematics, 2008.
7. Rara H.M., “Reduction procedures for calculating the determinant of the adjacency matrix of some graphs and the singularity of square planar grids”, Discrete Math., 1996, 151, 213-219.