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/757
DC FieldValueLanguage
dc.contributor.authorMihailovic, Bojanaen_US
dc.contributor.authorRasajski, Marijaen_US
dc.contributor.authorStanić, Zoranen_US
dc.date.accessioned2022-08-15T15:00:15Z-
dc.date.available2022-08-15T15:00:15Z-
dc.date.issued2016-01-01-
dc.identifier.issn14528630en
dc.identifier.urihttps://research.matf.bg.ac.rs/handle/123456789/757-
dc.description.abstractA graph is called reflexive if its second largest eigenvalue does not exceed 2. We survey the results on reflexive cacti obtained in the last two decades. We also discuss various patterns of appearing of Smith graphs as subgraphs of reflexive cacti. In the Appendix, we survey the recent results concerning reflexive bipartite regular graphs.en
dc.relation.ispartofApplicable Analysis and Discrete Mathematicsen
dc.subjectAdjacencymatrix, second largest eigenvalue, reflexive graph, cactus, regular graphen
dc.titleReflexive cacti: a surveyen_US
dc.typeArticleen_US
dc.identifier.doi10.2298/AADM160929022M-
dc.identifier.scopus2-s2.0-85008239852-
dc.identifier.urlhttps://api.elsevier.com/content/abstract/scopus_id/85008239852-
dc.contributor.affiliationNumerical Mathematics and Optimizationen_US
dc.relation.firstpage552en
dc.relation.lastpage568en
dc.relation.volume10en
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)

9
checked on Nov 15, 2024

Google ScholarTM

Check

Altmetric

Altmetric


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