1. Research with MATF
  2. MATF
  3. Research outputs
Please use this identifier to cite or link to this item: https://research.matf.bg.ac.rs/handle/123456789/1548
DC FieldValueLanguage
dc.contributor.authorAnđelić, Milicaen_US
dc.contributor.authorKoledin, Tamaraen_US
dc.contributor.authorStanić, Zoranen_US
dc.date.accessioned2025-03-04T15:23:55Z-
dc.date.available2025-03-04T15:23:55Z-
dc.date.issued2025-05-15-
dc.identifier.issn0166218X-
dc.identifier.urihttps://research.matf.bg.ac.rs/handle/123456789/1548-
dc.description.abstractIn this paper, we determine all connected net-regular strongly regular signed graphs with vertex degree at most four.en_US
dc.language.isoenen_US
dc.publisherElsevieren_US
dc.relation.ispartofDiscrete Applied Mathematicsen_US
dc.subjectCubic graphen_US
dc.subjectNet regularityen_US
dc.subjectQuartic graphen_US
dc.subjectSigned graphen_US
dc.subjectSpectrumen_US
dc.subjectStrong regularityen_US
dc.titleCubic and quartic net-regular strongly regular signed graphsen_US
dc.typeArticleen_US
dc.identifier.doi10.1016/j.dam.2025.01.026-
dc.identifier.scopus2-s2.0-85216076869-
dc.identifier.isi001413171000001-
dc.identifier.urlhttps://api.elsevier.com/content/abstract/scopus_id/85216076869-
dc.relation.issn0166-218Xen_US
dc.description.rankM23en_US
dc.relation.firstpage216en_US
dc.relation.lastpage225en_US
dc.relation.volume366en_US
item.openairetypeArticle-
item.fulltextNo Fulltext-
item.cerifentitytypePublications-
item.grantfulltextnone-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.languageiso639-1en-
crisitem.author.deptNumerical Mathematics and Optimization-
crisitem.author.orcid0000-0002-4949-4203-
Appears in Collections:Research outputs
Show simple item record

Google ScholarTM

Check

Altmetric

Altmetric


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