English

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 M(G)M(\mathcal{G}) (mr(G)mr(\mathcal{G})) for a graph G\mathcal{G}. 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, XS(G)X_S(G), where G=aG=\langle a\rangle is a cyclic group, or G=G1××GtG=G_1\times \cdots\times G_t such that G1=aG_1=\langle a\rangle is a cyclic group and GiG_i is an arbitrary finite group, for some 2it2\leq i\leq t, with determine the spectrum of Cayley graphs.

Keywords

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

R2 v1 2026-06-22T20:00:54.134Z