Maximal signed bipartite graphs with totally disconnected graphs as star complements

Abstract

Let B BH, μ denote an arbitrary signed bipartite graph with H as a star complement for an eigenvalue μ, where H is a totally disconnected graph of order s. In this paper, by using Hadamard and Conference matrices as tools, the maximum order of B and the extremal graphs are studied. It is shown that B exists if and only if μ2 is a positive integer. A formula of the maximum order of B is given in the case of μ2=p× q such that p, q are integers and there exists a p-order Hadamard or (p+1)-order Conference matrix. In particular, it is proved the maximum order of B is 2s when either q=1, s=cμ2=cp or q=1, s=c(μ2+1)=c(p+1), c=1,2,3,·s. Futhermore, some extremal graphs are characterized.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…