Summary of - Some Properties of Chain and Threshold Graphs
Document Type
Article
Abstract
Chain graphs and threshold graphs are special classes of graphs which have maximum spectral radius among bipartite graphs and connected graphs with given order and size, respectively. In this article, we focus on some of linear algebraic tools like rank, determinant, and permanent related to the adjacency matrix of these types of graphs. We
derive results relating the rank and number of edges. We also characterize chain/threshold graphs with nonzero determinant and permanent.
Index Terms: Chain, Bipartite graphs, Rank, Determinant, Permanent.
Recommended Citation: Hanif, S., Bhat, K. Arathi., & G., Sudhakara, Some Properties of Chain and Threshold Graphs. The Journal of the Indian Mathematical Society, vol. 90, no. 1-2, pp75–84, 2023
Publication Date
2023
Recommended Citation
HANIF, SHAHISTHA; ARATHI BHAT, K.; and G, SUDHAKARA, "Summary of - Some Properties of Chain and Threshold Graphs" (2023). Open Access archive. 9257.
https://impressions.manipal.edu/open-access-archive/9257
