On the eigenvalues of signed complete bipartite graphs

From MaRDI portal



Abstract: Let Gamma=(G,sigma) be a signed graph, where sigma is the sign function on the edges of G. The adjacency matrix of Gamma=(G,sigma) is a square matrix A(Gamma)=A(G,sigma)=left(aijsigmaight), where aijsigma=sigmaleft(vivjight)aij. In this paper, we determine the eigenvalues of the signed complete bipartite graphs. Let (Kp,q,sigma), pleqq, be a signed complete bipartite graph with bipartition (Up,Vq), where Up=u1,u2,ldots,up and Vq=v1,v2,ldots,vq. Let (Kp,q,sigma)[UrcupVs], rleqp and sleqq, be an induced signed subgraph on minimum vertices r+s, which contains all negative edges of the signed graph (Kp,q,sigma). We show that the multiplicity of eigenvalue 0 in (Kp,q,sigma) is at least p+q−2k−2, where k=min(r,s). We determine the spectrum of signed complete bipartite graph whose negative edges induce disjoint complete bipartite subgraphs and path. We obtain the spectrum of signed complete bipartite graph whose negative edges (positive edges) induce an r− regular subgraph H. We find a relation between the eigenvalues of this signed complete bipartite graph and the non-negative eigenvalues of H.














This page was built for publication: On the eigenvalues of signed complete bipartite graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6382990)