Please use this identifier to cite or link to this item: https://research.matf.bg.ac.rs/handle/123456789/720
DC FieldValueLanguage
dc.contributor.authorStanić, Zoranen_US
dc.date.accessioned2022-08-15T15:00:11Z-
dc.date.available2022-08-15T15:00:11Z-
dc.date.issued2019-01-01-
dc.identifier.issn18553966en
dc.identifier.urihttps://research.matf.bg.ac.rs/handle/123456789/720-
dc.description.abstractA signed graph is called integral if its spectrum consists entirely of integers, it is r-regular if its underlying graph is regular of degree r, and it is net-balanced if the difference between positive and negative vertex degree is a constant on the vertex set (this constant is called the net-balance and denoted %). We determine all the connected integral 3-regular net-balanced signed graphs. In the next natural step, for r = 4, we consider only those whose net-balance is a simple eigenvalue. There, we complete the list of feasible spectra in bipartite case for % 6= 0 and prove the non-existence for % = 0. Certain existence conditions are established and the existence of some 4-regular (simple) graphs is confirmed. In this study we transferred some results from the theory of graph spectra; in particular, we give a counterpart to the Hoffman polynomial.en
dc.relation.ispartofArs Mathematica Contemporaneaen_US
dc.subjectAdjacency matrixen
dc.subjectNet-balanced signed graphen
dc.subjectSigned graphen
dc.subjectSwitching equivalent signed graphsen
dc.titleIntegral regular net-balanced signed graphs with vertex degree at most fouren_US
dc.typeArticleen_US
dc.identifier.doi10.26493/1855-3974.1740.803-
dc.identifier.scopus2-s2.0-85071022050-
dc.identifier.isi000486576300001-
dc.identifier.urlhttps://api.elsevier.com/content/abstract/scopus_id/85071022050-
dc.contributor.affiliationNumerical Mathematics and Optimizationen_US
dc.relation.issn1855-3966en_US
dc.description.rankM22en_US
dc.relation.firstpage103en_US
dc.relation.lastpage114en_US
dc.relation.volume17en_US
dc.relation.issue1en_US
item.grantfulltextnone-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.openairetypeArticle-
item.fulltextNo Fulltext-
item.cerifentitytypePublications-
crisitem.author.deptNumerical Mathematics and Optimization-
crisitem.author.orcid0000-0002-4949-4203-
Appears in Collections:Research outputs
Show simple item record

SCOPUSTM   
Citations

30
checked on Mar 31, 2025

Page view(s)

25
checked on Jan 19, 2025

Google ScholarTM

Check

Altmetric

Altmetric


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