English

Regular graphs with a complete bipartite graph as a star complement

Combinatorics 2022-10-11 v1

Abstract

Let GG be a graph of order nn and μ\mu be an adjacency eigenvalue of GG with multiplicity k1k\geq 1. A star complement HH for μ\mu in GG is an induced subgraph of GG of order nkn-k with no eigenvalue μ\mu, and the vertex subset X=V(GH)X=V(G-H) is called a star set for μ\mu in GG. The study of star complements and star sets provides a strong link between graph structure and linear algebra. In this paper, we study the regular graphs with Kt,s (st2)K_{t,s}\ (s\geq t\geq 2) as a star complement for an eigenvalue μ\mu, especially, characterize the case of t=3t=3 completely, obtain some properties when t=st=s, and propose some problems for further study.

Keywords

Cite

@article{arxiv.2210.04160,
  title  = {Regular graphs with a complete bipartite graph as a star complement},
  author = {Xiaona Fang and Lihua You and Rangwei Wu and Yufei Huang},
  journal= {arXiv preprint arXiv:2210.04160},
  year   = {2022}
}
R2 v1 2026-06-28T03:04:59.490Z