On the eigenvalues of signed complete bipartite graphs

Abstract

Let =(G,σ) be a signed graph, where σ is the sign function on the edges of G. The adjacency matrix of =(G, σ) is a square matrix A()=A(G, σ)=(ai jσ), where ai jσ=σ(vi vj) ai j. In this paper, we determine the eigenvalues of the signed complete bipartite graphs. Let (Kp, q,σ), p≤ q, be a signed complete bipartite graph with bipartition (Up, Vq), where Up=\u1,u2,…,up\ and Vq=\v1,v2,…,vq\. Let (Kp, q,σ)[Ur Vs], r≤ p and s≤ q , be an induced signed subgraph on minimum vertices r+s, which contains all negative edges of the signed graph (Kp, q,σ). We show that the multiplicity of eigenvalue 0 in (Kp, q,σ) 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.

0

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.

Discussion (0)

Sign in to join the discussion.

Loading comments…