English

Maximal signed bipartite graphs with totally disconnected graphs as star complements

Combinatorics 2023-12-27 v1 Mathematical Physics math.MP

Abstract

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

Keywords

Cite

@article{arxiv.2312.15990,
  title  = {Maximal signed bipartite graphs with totally disconnected graphs as star complements},
  author = {Huiqun Jiang and Yue Liu},
  journal= {arXiv preprint arXiv:2312.15990},
  year   = {2023}
}
R2 v1 2026-06-28T14:01:59.111Z