Some universal graphs
Given a graph G with vertex set V (G) = {x1, x2, . . . , xn}, we define the adjacency matrix of G to be the matrix A(G) = [aij ] where aij = 1 if xi and xj are adjacent in G. From the set of all adjacency matrices of G, denoted by A (G), we then form the subspace spanned by this set, denoted by (A (...
Saved in:
| Main Authors: | , |
|---|---|
| 格式: | text |
| 出版: |
Animo Repository
2009
|
| 主題: | |
| 在線閱讀: | https://animorepository.dlsu.edu.ph/faculty_research/11218 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|