Please use this identifier to cite or link to this item:
https://hdl.handle.net/10356/162136
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Greaves, Gary Royden Watson | en_US |
dc.contributor.author | Stanić, Zoran | en_US |
dc.date.accessioned | 2022-10-05T02:28:10Z | - |
dc.date.available | 2022-10-05T02:28:10Z | - |
dc.date.issued | 2022 | - |
dc.identifier.citation | 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 | en_US |
dc.identifier.issn | 1063-8539 | en_US |
dc.identifier.uri | https://hdl.handle.net/10356/162136 | - |
dc.description.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. | en_US |
dc.description.sponsorship | Ministry of Education (MOE) | en_US |
dc.language.iso | en | en_US |
dc.relation | RG21/20 | en_US |
dc.relation.ispartof | Journal of Combinatorial Designs | en_US |
dc.rights | © 2022 Wiley Periodicals LLC. All rights reserved. | en_US |
dc.subject | Science::Mathematics | en_US |
dc.title | Signed (0,2)-graphs with few eigenvalues and a symmetric spectrum | en_US |
dc.type | Journal Article | en |
dc.contributor.school | School of Physical and Mathematical Sciences | en_US |
dc.identifier.doi | 10.1002/jcd.21828 | - |
dc.identifier.scopus | 2-s2.0-85124471280 | - |
dc.identifier.issue | 5 | en_US |
dc.identifier.volume | 30 | en_US |
dc.identifier.spage | 332 | en_US |
dc.identifier.epage | 353 | en_US |
dc.subject.keywords | Adjacency Matrix | en_US |
dc.subject.keywords | Bipartite Double | en_US |
dc.description.acknowledgement | The first author was supported in part by the Singapore Ministry of Education Academic Research Fund (Tier 1); grant number RG21/20. The second author was supported by the Science Fund of the Republic of Serbia; grant number 7749676: Spectrally Constrained Signed Graphs with Applications in Coding Theory and Control Theory—SCSG‐ctct. | en_US |
item.fulltext | No Fulltext | - |
item.grantfulltext | none | - |
Appears in Collections: | SPMS Journal Articles |
SCOPUSTM
Citations
50
1
Updated on Mar 27, 2024
Web of ScienceTM
Citations
50
1
Updated on Oct 26, 2023
Page view(s)
83
Updated on Mar 27, 2024
Google ScholarTM
Check
Altmetric
Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.