The work of Wang et al. (2020) established an upper bound on the multiplicity of a real number as an adjacency eigenvalue of an undirected simple graph G according to the dimension of its cycle space and the number of its pendants. The work of Cardoso et al. (2018) studied the multiplicity of alpha as an eigenvalue of alpha D(G) + (1 - alpha)A(G), alpha is an element of [0, 1), where D(G) is the diagonal matrix of degrees and A(G) is the adjacency matrix of G, which was ported to signed graphs by the work of Belardo et al. (2019). Here, on the one hand, we consider both the Wang-Wei-Jin-type a...
