DC FieldValueLanguage
dc.contributor.authorGrünewald, Stefanen
dc.contributor.authorStevanović, Draganen
dc.date.accessioned2020-05-01T20:13:05Z-
dc.date.available2020-05-01T20:13:05Z-
dc.date.issued2005-01-01en
dc.identifier.issn0893-9659en
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/1301-
dc.description.abstractClassification of harmonic and semiharmonic graphs according to their cyclomatic number became of interest recently. All finite harmonic graphs with up to four independent cycles, as well as all finite semiharmonic graphs with at most one cycle were determined. Here, we determine all finite semiharmonic bicyclic graphs. Besides that, we present several methods for constructing semiharmonic graphs from existing ones, and we apply one of these constructions to show that the number of semiharmonic graphs with fixed cyclomatic number k is infinite for every k.en
dc.publisherElsevier-
dc.relationSerbian Ministry of Science, Technology and Development, Grant 1227-
dc.relation.ispartofApplied Mathematics Lettersen
dc.subjectBicyclic graphs | Constructions of new graphs | Harmonic graphs | Semiharmonic graphs | Walks in graphsen
dc.titleSemiharmonic bicyclic graphsen
dc.typeArticleen
dc.identifier.doi10.1016/j.aml.2005.03.001en
dc.identifier.scopus2-s2.0-25144477867en
dc.relation.firstpage1228en
dc.relation.lastpage1238en
dc.relation.issue11en
dc.relation.volume18en
dc.description.rankM23-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.openairetypeArticle-
item.cerifentitytypePublications-
item.fulltextNo Fulltext-
item.grantfulltextnone-
crisitem.author.orcid0000-0003-2908-305X-
Show simple item record

SCOPUSTM   
Citations

5
checked on Nov 19, 2024

Page view(s)

24
checked on Nov 19, 2024

Google ScholarTM

Check

Altmetric

Altmetric


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