Maximum nullity of Cayley graph
Combinatorics
2017-05-30 v1
Abstract
One of the most interesting problems on maximum nullity (minimum rank) is to characterize () for a graph . In this regard, many researchers have been trying to find an upper or lower bound for the maximum nullity. For more results on this topic, see \cite{4}, \cite{2}, \cite{10} and \cite{1}. In this paper, by using a result of Babai \cite{Babai}, which presents the spectrum of a Cayley graph in terms of irreducible characters of the underlying group, and using representation and character of groups, we give a lower bound for the maximum nullity of Cayley graph, , where is a cyclic group, or such that is a cyclic group and is an arbitrary finite group, for some , with determine the spectrum of Cayley graphs.
Cite
@article{arxiv.1705.09790,
title = {Maximum nullity of Cayley graph},
author = {Ebrahim Vatandoost and Yasser Golkhandy Pour},
journal= {arXiv preprint arXiv:1705.09790},
year = {2017}
}
Comments
7 pages