2000 character limit reached
Regular graphs with a complete bipartite graph as a star complement
Published 9 Oct 2022 in math.CO | (2210.04160v1)
Abstract: Let be a graph of order and be an adjacency eigenvalue of with multiplicity . A star complement for in is an induced subgraph of of order with no eigenvalue , and the vertex subset is called a star set for in . 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 as a star complement for an eigenvalue , especially, characterize the case of completely, obtain some properties when , and propose some problems for further study.
Paper Prompts
Sign up for free to create and run prompts on this paper.