The Number of Distinct Eigenvalues of Adjacency Matriz of Graghs

摘要：

Let G be a graph with n vertices and m edges. The matrix A(G) is the adjacency matrix of G. In this paper, we give a relation between the number of distinct adjacency matrix and the number of closed walks for graphs.

关键词： Eigenvalues Closed walk Rank of matriz

作者: Gaoyan Zhang Haifeng Ke

作者单位: School of Computer and Computing Science, City College of Zhejiang University

会议类型: 国际会议

会议名称: The Third International Workshop on Applied Matriz Theory(第三届国际矩阵分析与应用会议)

会议地点: 杭州

会议语种:英文

页码: 216-218

在线出版日期: 2009-07-09（万方平台首次上网日期，不代表论文的发表时间）