Maximum nullity of Cayley graph
Abstract
One of the most interesting problems on maximum nullity (minimum rank) is to characterize M(G) (mr(G)) for a graph 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 4, 2, 10 and 1. In this paper, by using a result of Babai 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), where G= a is a cyclic group, or G=G1× ·s× Gt such that G1= a is a cyclic group and Gi is an arbitrary finite group, for some 2≤ i≤ t, with determine the spectrum of Cayley graphs.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.