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/738
DC FieldValueLanguage
dc.contributor.authorAndelić, Milicaen_US
dc.contributor.authorKoledin, Tamaraen_US
dc.contributor.authorStanić, Zoranen_US
dc.date.accessioned2022-08-15T15:00:13Z-
dc.date.available2022-08-15T15:00:13Z-
dc.date.issued2021-
dc.identifier.urihttps://research.matf.bg.ac.rs/handle/123456789/738-
dc.description.abstractWe revisit results obtained in [1], where several necessary and necessary and sufficient conditions for a connected threshold graph to be Hamiltonian were obtained. We present these results in new forms, now stated in terms of structural parameters that uniquely define the threshold graph and we extend them to chain graphs. We also identify the chain graph with minimum number of Hamilton cycles within the class of Hamiltonian chain graphs of a given order.en
dc.relation.ispartofAIMS Mathematicsen
dc.subjectAlgorithmen
dc.subjectBinary sequenceen
dc.subjectChain graphen
dc.subjectHamiltonian graphen
dc.subjectThreshold graphen
dc.titleNotes on hamiltonian threshold and chain graphsen_US
dc.typeArticleen_US
dc.identifier.doi10.3934/math.2021300-
dc.identifier.scopus2-s2.0-85102195558-
dc.identifier.urlhttps://api.elsevier.com/content/abstract/scopus_id/85102195558-
dc.contributor.affiliationNumerical Mathematics and Optimizationen_US
dc.description.rankM21en_US
dc.relation.firstpage5078en
dc.relation.lastpage5087en
dc.relation.volume6en
dc.relation.issue5en
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

Page view(s)

18
checked on Nov 15, 2024

Google ScholarTM

Check

Altmetric

Altmetric


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