A study of singular and nonsingular graphs using reduction formulas
A graph is said to be singular if the determinant of its adjacency matrix is equal to zero. Otherwise, the graph is said to be nonsingular. This thesis studies some classes of graphs in relation to singularity or nonsingularity. Several reduction formulas were used to facilitate the computation of t...
Saved in:
| Main Authors: | , |
|---|---|
| 格式: | text |
| 語言: | English |
| 出版: |
Animo Repository
1997
|
| 主題: | |
| 在線閱讀: | https://animorepository.dlsu.edu.ph/etd_bachelors/16429 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| 機構: | De La Salle University |
| 語言: | English |