ARTICLE
TITLE

Eigenvalues of Antiadjacency Matrix of Cayley Graph of Z_n

SUMMARY

In this paper, we give a relation between the eigenvalues of the antiadjacency matrix of Cay(Z_n, S) and the eigenvalues of the antiadjacency matrix of Cay(Z_n, (Z_n-{0})-S), as well as the eigenvalues of the adjacency matrix of Cay(Z_n, S). Then, we give the characterization of connection set S where the eigenvalues of the antiadjacency matrix of Cay(Z_n, S) are all integers.

PAGES
pp. 66 - 76

 Articles related

Michael Gil'    


Revista: Proyecciones

Jeetendra Gurjar,Sudhir Raghunath Jog    

The degree sum exponent distance matrix M(G)of a graph G is a square matrix whose (i,j)-th entry is (di+dj)^ d(ij) whenever i not equal to j, otherwise it is zero, where di is the degree of i-th vertex of G and d(ij)=d(vi,vj) is distance between vi and v... see more


Miquel Àngel Fiol,Safet Penjic    

Given a regular (connected) graph G=(X,E) with adjacency matrix A, d+1 distinct eigenvalues, and diameter D, we give a characterization  of when its distance matrix AD is a polynomial in A, in terms of the adjacency spectrum of G and the arithmetic ... see more


Olena Teteriatnyk    

Conditions for the stabilizability of discrete almost conservative systems in which the coefficient matrix of a conservative part has no multiple eigenvalues are investigated.It is known that a controllable system will be stabilized if its coefficient ma... see more


Muhammad Syifa’ul Mufid,Subiono -    

A Latin square of order n is a square matrix with n di?erent numberssuch that numbers in each column and each row are distinct. Max-plus Algebra isalgebra that uses two operations, ? and ?. In this paper, we solve the eigenproblemfor Latin squares in Max... see more