Please use this identifier to cite or link to this item: https://research.matf.bg.ac.rs/handle/123456789/1382
Title: Regular graphs with a cycle as a star complement
Authors: Stanić, Zoran 
Affiliations: Numerical Mathematics and Optimization 
Keywords: Adjacency matrix;Star complement;Regular graph;circulant graph;inverse
Issue Date: 2024
Publisher: Shahin Digital Publisher
Journal: Discrete Mathematics Letters
Abstract: 
Let G be an n-vertex graph having an eigenvalue µ of multiplicity k. A star complement for µ in G is an induced subgraph H with n − k vertices, such that µ is not its eigenvalue. In the case when H is a t-vertex cycle Ct with t ≥ 3, it is shown that G is regular if and only if µ ∈ {3, 1, 0, −1, −2}. For µ = 3 and µ = 1, G is the complete graph K4 and the Petersen graph, respectively. For µ ∈ {0, −1}, a structural characterization of infinite families of graphs that appear in the role of G is given,and their existence is shown. The obtained results, together with the result of [F. K. Bell, Linear Algebra Appl. 296 (1999) 15–25] concerning µ = −2, establish a complete characterization of regular graphs having Ct as a star complement for some
eigenvalue
URI: https://research.matf.bg.ac.rs/handle/123456789/1382
DOI: 10.47443/dml.2024.141
Rights: Attribution 3.0 United States
Appears in Collections:Research outputs

Files in This Item:
File Description SizeFormat
DML24_v14_pp70-76.pdf379.84 kBAdobe PDF
View/Open
Show full item record

Page view(s)

7
checked on Nov 15, 2024

Download(s)

6
checked on Nov 15, 2024

Google ScholarTM

Check

Altmetric

Altmetric


This item is licensed under a Creative Commons License Creative Commons