Maximal graphs with a prescribed complete bipartite graph as a star complement

Let G be a graph of order n and μ be an adjacency eigenvalue of G with multiplicity k≥1. A star complement for μ in G is an induced subgraph of G of order n−k with no eigenvalue μ. In this paper, we characterize the maximal graphs with the bipartite graph K<sub>2</sub>,s as a star comple...

Full description

Bibliographic Details
Main Authors: Xiaona Fang, Lihua You, Yufei Huang
Format: Article
Language:English
Published: AIMS Press 2021-05-01
Series:AIMS Mathematics
Subjects:
Online Access:https://www.aimspress.com/article/doi/10.3934/math.2021419?viewType=HTML