English

On the eigenvalues of signed complete bipartite graphs

Combinatorics 2021-11-16 v1

Abstract

Let Γ=(G,σ)\Gamma=(G,\sigma) be a signed graph, where σ\sigma is the sign function on the edges of GG. The adjacency matrix of Γ=(G,σ)\Gamma=(G, \sigma) is a square matrix A(Γ)=A(G,σ)=(aijσ)A(\Gamma)=A(G, \sigma)=\left(a_{i j}^{\sigma}\right), where aijσ=σ(vivj)aija_{i j}^{\sigma}=\sigma\left(v_{i} v_{j}\right) a_{i j}. In this paper, we determine the eigenvalues of the signed complete bipartite graphs. Let (Kp,q,σ)(K_{p, q},\sigma), pqp\leq q, be a signed complete bipartite graph with bipartition (Up,Vq)(U_p, V_q), where Up={u1,u2,,up}U_p=\{u_1,u_2,\ldots,u_p\} and Vq={v1,v2,,vq}V_q=\{v_1,v_2,\ldots,v_q\}. Let (Kp,q,σ)[UrVs](K_{p, q},\sigma)[U_r\cup V_s], rpr\leq p and sqs\leq q , be an induced signed subgraph on minimum vertices r+sr+s, which contains all negative edges of the signed graph (Kp,q,σ)(K_{p, q},\sigma). We show that the multiplicity of eigenvalue 00 in (Kp,q,σ)(K_{p, q},\sigma) is at least p+q2k2 p+q-2k-2, where k=min(r,s)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 rr- regular subgraph HH. We find a relation between the eigenvalues of this signed complete bipartite graph and the non-negative eigenvalues of HH.

Keywords

Cite

@article{arxiv.2111.07262,
  title  = {On the eigenvalues of signed complete bipartite graphs},
  author = {S. Pirzada and Tahir Shamsher and Mushtaq A. Bhat},
  journal= {arXiv preprint arXiv:2111.07262},
  year   = {2021}
}

Comments

18 pages, 2 figures

R2 v1 2026-06-24T07:37:36.210Z