A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
The non-singularity of looped trees and complement of trees with diameter 5
2015
The Australasian Journal of Combinatorics
Preserved Fulltext
A graph G is said to be singular if its adjacency matrix is singular; otherwise it is said to be non-singular. In this paper, we introduce a class of graphs called looped-trees, and find the determinant and the nonsingularity of looped-trees. Moreover, we determine the singularity or non-singularity of the complement of a certain class of trees with diameter 5 by using the results for looped-trees.
dblp:journals/ajc/PipattanajindaK15
fatcat:3rqtx5mpurb5vh6nmfnn7o2cfu