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.
| Original language | English |
|---|---|
| Pages (from-to) | 75-84 |
| Number of pages | 10 |
| Journal | Journal of the Indian Mathematical Society |
| Volume | 90 |
| Issue number | 1-2 |
| DOIs | |
| Publication status | Published - 03-2023 |
All Science Journal Classification (ASJC) codes
- General Mathematics
Fingerprint
Dive into the research topics of 'SOME PROPERTIES OF CHAIN AND THRESHOLD GRAPHS'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver