Papers
Topics
Authors
Recent
Search
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 GG be a graph of order nn and μ\mu be an adjacency eigenvalue of GG with multiplicity k≥1k\geq 1. A star complement HH for μ\mu in GG is an induced subgraph of GG of order n−kn-k with no eigenvalue μ\mu, and the vertex subset X=V(G−H)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 (s≥t≥2)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.

Citations (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.