Please use this identifier to cite or link to this item:
https://research.matf.bg.ac.rs/handle/123456789/1337
Title: | Strong star complements in graphs | Authors: | Anđelić, Milica Rowlinson, Peter Stanić, Zoran |
Keywords: | Adjacency matrix;Eigenvalue;Exceptional graph;Line graph;Star complement;Star partition;Strongly regular graph | Issue Date: | 1-May-2024 | Rank: | M21 | Publisher: | Elsevier | Journal: | Linear Algebra and Its Applications | Abstract: | Let G be a finite simple graph with λ as an eigenvalue (i.e. an eigenvalue of the adjacency matrix of G), and let H be a star complement for λ in G. Motivated by a controllability condition, we say that H is a strong star complement for λ if G and H have no eigenvalue in common. We explore this concept in the context of line graphs, exceptional graphs, strongly regular graphs and graphs with a prescribed star complement. |
URI: | https://research.matf.bg.ac.rs/handle/123456789/1337 | ISSN: | 00243795 | DOI: | 10.1016/j.laa.2024.01.025 | Rights: | Attribution-NonCommercial-NoDerivs 3.0 United States |
Appears in Collections: | Research outputs |
Files in This Item:
File | Description | Size | Format | Existing users please |
---|---|---|---|---|
StrongStarComplR1.pdf | 111.26 kB | Adobe PDF | Request a copy | Embargoed until May 1, 2026
Page view(s)
23
checked on Nov 14, 2024
Download(s)
1
checked on Nov 14, 2024
Google ScholarTM
Check
Altmetric
Altmetric
This item is licensed under a Creative Commons License