Please use this identifier to cite or link to this item: http://hdl.handle.net/1893/32473
Full metadata record
DC FieldValueLanguage
dc.contributor.authorRamezani, Farzanehen_UK
dc.contributor.authorRowlinson, Peteren_UK
dc.contributor.authorStaniĆ, Zoranen_UK
dc.date.accessioned2021-03-25T01:17:36Z-
dc.date.available2021-03-25T01:17:36Z-
dc.date.issued2022en_UK
dc.identifier.urihttp://hdl.handle.net/1893/32473-
dc.description.abstractWe consider signed graphs with just 2 or 3 distinct eigenvalues, in particular (i) those with at least one simple eigenvalue, and (ii) those with vertexdeleted subgraphs which themselves have at most 3 distinct eigenvalues. We also construct new examples using weighing matrices and symmetric 3-class association schemesen_UK
dc.language.isoenen_UK
dc.publisherFaculty of Mathematics, Computer Science and Econometrics, University of Zielona Goraen_UK
dc.relationRamezani F, Rowlinson P & StaniĆ Z (2022) More on signed graphs with at most three eigenvalues. Discussiones Mathematicae Graph Theory, 42 (4), pp. 1313-1331. https://doi.org/10.7151/dmgt.2393en_UK
dc.rightsUnder the Creative Commons Attribution-NonCommercial-NoDerivs license, the author(s) and users are free to share (copy, distribute and transmit the contribution) under the following conditions: 1. they must attribute the contribution in the manner specified by the author or licensor, 2. they may not use this contribution for commercial purposes, 3. they may not alter.en_UK
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/4.0/en_UK
dc.subjectadjacency matrixen_UK
dc.subjectsimple eigenvalueen_UK
dc.subjectstrongly regular signed graphen_UK
dc.subjectvertex-deleted subgraphen_UK
dc.subjectweighing matrixen_UK
dc.subjectassociation schemeen_UK
dc.titleMore on signed graphs with at most three eigenvaluesen_UK
dc.typeJournal Articleen_UK
dc.identifier.doi10.7151/dmgt.2393en_UK
dc.citation.jtitleDiscussiones Mathematicae Graph Theoryen_UK
dc.citation.issn2083-5892en_UK
dc.citation.issn1234-3099en_UK
dc.citation.volume42en_UK
dc.citation.issue4en_UK
dc.citation.spage1313en_UK
dc.citation.epage1331en_UK
dc.citation.publicationstatusPublisheden_UK
dc.citation.peerreviewedRefereeden_UK
dc.type.statusVoR - Version of Recorden_UK
dc.citation.date11/02/2021en_UK
dc.contributor.affiliationK.N. Toosi University of Technologyen_UK
dc.contributor.affiliationMathematicsen_UK
dc.contributor.affiliationUniversity of Belgradeen_UK
dc.identifier.isiWOS:000737388500003en_UK
dc.identifier.scopusid2-s2.0-85102148304en_UK
dc.identifier.wtid1707351en_UK
dc.contributor.orcid0000-0003-4878-3203en_UK
dc.date.accepted2021-01-25en_UK
dcterms.dateAccepted2021-01-25en_UK
dc.date.filedepositdate2021-03-24en_UK
rioxxterms.apcnot chargeden_UK
rioxxterms.typeJournal Article/Reviewen_UK
rioxxterms.versionVoRen_UK
local.rioxx.authorRamezani, Farzaneh|en_UK
local.rioxx.authorRowlinson, Peter|0000-0003-4878-3203en_UK
local.rioxx.authorStaniĆ, Zoran|en_UK
local.rioxx.projectInternal Project|University of Stirling|https://isni.org/isni/0000000122484331en_UK
local.rioxx.freetoreaddate2021-03-24en_UK
local.rioxx.licencehttp://creativecommons.org/licenses/by-nc-nd/4.0/|2021-03-24|en_UK
local.rioxx.filenameDMGT-2393.pdfen_UK
local.rioxx.filecount1en_UK
local.rioxx.source2083-5892en_UK
Appears in Collections:Computing Science and Mathematics Journal Articles

Files in This Item:
File Description SizeFormat 
DMGT-2393.pdfFulltext - Published Version197.99 kBAdobe PDFView/Open


This item is protected by original copyright



A file in this item is licensed under a Creative Commons License Creative Commons

Items in the Repository are protected by copyright, with all rights reserved, unless otherwise indicated.

The metadata of the records in the Repository are available under the CC0 public domain dedication: No Rights Reserved https://creativecommons.org/publicdomain/zero/1.0/

If you believe that any material held in STORRE infringes copyright, please contact library@stir.ac.uk providing details and we will remove the Work from public display in STORRE and investigate your claim.