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...
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 |
Similar Items
-
Regular graphs with a cycle as a star complement
by: Zoran Stanić
Published: (2024-11-01) -
On Trees as Star Complements in Regular Graphs
by: Rowlinson Peter
Published: (2020-05-01) -
Star complements for ±2 in signed graphs
by: Mulas Raffaella, et al.
Published: (2022-02-01) -
Star metric dimension of complete, bipartite, complete bipartite and fan graphs
by: Reni Umilasari, et al.
Published: (2022-06-01) -
Decomposition of complete bipartite graphs into cycles and stars with four edges
by: M. Ilayaraja, et al.
Published: (2020-09-01)