Let [Math Processing Error] Gϕ be an n-vertex complex unit gain graph and let G be its underlying graph. The adjacency rank of [Math Processing Error] Gϕ , written as [Math Processing Error] r(Gϕ) , is the rank of its adjacency matrix and denote by [Math Processing Error] α′(G) the matching number of the underlying graph G. In this contribution, based on combinatorial interpretation of all the coefficients of the characteristic polynomial of [Math Processing Error] Gϕ , we determine sharp upper and lower bounds on [Math Processing Error] ...
