Regular graphs with a complete bipartite graph as a star complement
Xiaona Fang, Lihua You, Rangwei Wu, Yufei Huang

TL;DR
This paper investigates regular graphs that contain a complete bipartite graph as a star complement for an eigenvalue, providing characterizations and properties, especially for the case when one part has size three.
Contribution
It characterizes regular graphs with a complete bipartite graph as a star complement for an eigenvalue, focusing on the case t=3 and exploring properties when t=s.
Findings
Complete characterization for t=3 case.
Properties of regular graphs with K_{t,s} as star complement when t=s.
Proposed open problems for future research.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph theory and applications · Synthesis and properties of polymers · Synthesis and Properties of Aromatic Compounds
