On conjugate adjacency matrices of a graph (Q868333)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On conjugate adjacency matrices of a graph |
scientific article |
Statements
On conjugate adjacency matrices of a graph (English)
0 references
2 March 2007
0 references
Let \(G\) be a simple graph, \(c=a+b\sqrt m\) and \(\overline c=a-b\sqrt m\), where \(a\) and \(b\) are two nonzero integers and \(m\) is a positive integer such that \(m\) is not a perfect square. We say that \(A=[c_{i,j}]\) is the conjugate adjacency matrix of the graph \(G\) if \(c_{i,j}=c\) for any two adjacent vertices \(i\) and \(j\), \(c_{i,j}=\overline c\) for any two nonadjacent vertices \(i\) and \(j\), and \(c_{i,j}=0\) if \(i=j\). Let \(P_G(\lambda)=| \lambda I-A| \) and \(P^c_G(\lambda)=| \lambda I-A^c| \) denote the characteristic polynomial and the conjugate characteristic polynomial of \(G\), respectively. In this paper it is shown that if \(P^c_G(\lambda)=P^c_H(\lambda)\) then \(P_{\overline G}^c(\lambda)=P_{\overline H}^c(\lambda)\), where \(\overline G\) denotes the complement of \(G\). In particular, it is proved that \(P^c_G(\lambda)=P^c_H(\lambda)\) if and only if \(P_G(\lambda)=P_H(\lambda)\) and \(P_{\overline G}(\lambda)=P_{\overline H}(\lambda)\).
0 references
graph
0 references
characteristic polynomial
0 references
conjugate characteristic polynomial
0 references
eigenvalue
0 references
main eigenvalue
0 references
cospectral graphs
0 references