Please use this identifier to cite or link to this item:
https://research.matf.bg.ac.rs/handle/123456789/743
Title: | On graphs whose second largest eigenvalue equals 1 - the star complement technique | Authors: | Stanić, Zoran | Affiliations: | Numerical Mathematics and Optimization | Keywords: | Adjacency matrix;Second largest eigenvalue;Star complement | Issue Date: | 15-Jan-2007 | Journal: | Linear Algebra and Its Applications | Abstract: | The star complement technique is a spectral tool recently developed for constructing some bigger graphs from their smaller parts, called star complements. Here we first identify among trees and complete graphs those graphs which can be star complements for 1 as the second largest eigenvalue. Using the graphs just obtained, we next search for their maximal extensions, either by theoretical means, or by computer aided search. © 2006 Elsevier Inc. All rights reserved. |
URI: | https://research.matf.bg.ac.rs/handle/123456789/743 | ISSN: | 00243795 | DOI: | 10.1016/j.laa.2006.08.025 |
Appears in Collections: | Research outputs |
Show full item record
SCOPUSTM
Citations
20
checked on Nov 8, 2024
Page view(s)
16
checked on Nov 15, 2024
Google ScholarTM
Check
Altmetric
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.