Please use this identifier to cite or link to this item: https://research.matf.bg.ac.rs/handle/123456789/754
DC FieldValueLanguage
dc.contributor.authorMilatović, Markoen_US
dc.contributor.authorStanić, Zoranen_US
dc.date.accessioned2022-08-15T15:00:14Z-
dc.date.available2022-08-15T15:00:14Z-
dc.date.issued2012-01-01-
dc.identifier.issn14505444en
dc.identifier.urihttps://research.matf.bg.ac.rs/handle/123456789/754-
dc.description.abstractWe determine all nested split graphs (NSG for short; i.e. graphs having no induced subgraphs equal to 2K2, P4, or C4) having the second largest eigenvalue equal to 1 and give some data regarding obtained results. The initial results in this research are given in the previous work of the second author, where all NSGs whose second largest eigenvalue is less than 1 are determined. It turns out that this case is well complicated with a number of solutions including some infinite families.en
dc.relation.ispartofNovi Sad Journal of Mathematicsen
dc.subjectNested split graphen
dc.subjectSecond largest eigenvalueen
dc.titleThe nested split graphs whose second largest eigenvalue is equal to 1en_US
dc.typeArticleen_US
dc.identifier.scopus2-s2.0-84897449365-
dc.identifier.urlhttps://api.elsevier.com/content/abstract/scopus_id/84897449365-
dc.contributor.affiliationNumerical Mathematics and Optimizationen_US
dc.relation.firstpage33en
dc.relation.lastpage42en
dc.relation.volume42en
dc.relation.issue2en
item.fulltextNo Fulltext-
item.openairetypeArticle-
item.grantfulltextnone-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
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

1
checked on Nov 8, 2024

Page view(s)

12
checked on Nov 15, 2024

Google ScholarTM

Check


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