Regular graphs with a complete bipartite graph as a star complement

Abstract

Let G be a graph of order n and μ be an adjacency eigenvalue of G with multiplicity k≥ 1. A star complement H for μ in G is an induced subgraph of G of order n-k with no eigenvalue μ, and the vertex subset X=V(G-H) is called a star set for μ in G. 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\ (s≥ t≥ 2) as a star complement for an eigenvalue μ, especially, characterize the case of t=3 completely, obtain some properties when t=s, and propose some problems for further study.

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…