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/1420
DC FieldValueLanguage
dc.contributor.authorStanić, Zoranen_US
dc.date.accessioned2025-01-20T15:16:34Z-
dc.date.available2025-01-20T15:16:34Z-
dc.date.issued2022-
dc.identifier.urihttps://research.matf.bg.ac.rs/handle/123456789/1420-
dc.language.isoenen_US
dc.relation.ispartofAmerican Journal of Combinatoricsen_US
dc.subjectSigned graphen_US
dc.subjectAdjacency matrixen_US
dc.subjectLargest eigenvalueen_US
dc.subjectFrustration indexen_US
dc.subjectVertex degreeen_US
dc.titleSome relations between the largest eigenvalue and the frustration index of a signed graphen_US
dc.typeArticleen_US
dc.contributor.affiliationNumerical Mathematics and Optimizationen_US
dc.relation.issn2768-4202en_US
dc.relation.firstpage65en_US
dc.relation.lastpage72en_US
dc.relation.volume1en_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


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