Please use this identifier to cite or link to this item:
|Title:||Signed (0,2)-graphs with few eigenvalues and a symmetric spectrum||Authors:||Greaves, Gary Royden Watson
|Keywords:||Science::Mathematics||Issue Date:||2022||Source:||Greaves, G. R. W. & Stanić, Z. (2022). Signed (0,2)-graphs with few eigenvalues and a symmetric spectrum. Journal of Combinatorial Designs, 30(5), 332-353. https://dx.doi.org/10.1002/jcd.21828||Project:||RG21/20||Journal:||Journal of Combinatorial Designs||Abstract:||We investigate properties of signed graphs that have few distinct eigenvalues together with a symmetric spectrum. Our main contribution is to determine all signed rectagraphs (triangle-free signed (Formula presented.) -graphs) with vertex degree at most 6 that have precisely two distinct eigenvalues (Formula presented.). Next, we consider to what extent induced subgraphs of signed graph with two distinct eigenvalues (Formula presented.) are determined by their spectra. Lastly, we classify signed rectagraphs that have a symmetric spectrum with three distinct eigenvalues and give a partial classification for signed (Formula presented.) -graphs with four distinct eigenvalues.||URI:||https://hdl.handle.net/10356/162136||ISSN:||1063-8539||DOI:||10.1002/jcd.21828||Rights:||© 2022 Wiley Periodicals LLC. All rights reserved.||Fulltext Permission:||none||Fulltext Availability:||No Fulltext|
|Appears in Collections:||SPMS Journal Articles|
Updated on Dec 5, 2022
Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.