DC FieldValueLanguage
dc.contributor.authorHansen, Pierreen
dc.contributor.authorStevanović, Draganen
dc.date.accessioned2020-05-01T20:13:04Z-
dc.date.available2020-05-01T20:13:04Z-
dc.date.issued2008-04-01en
dc.identifier.issn0166-218Xen
dc.description.abstractUsual graph classes, such as complete graphs, paths, cycles and stars, frequently appear as extremal graphs in graph theory problems. Here we want to turn the reader's attention to two novel, simply defined, graph classes that appear as extremal graphs in several graph theory problems. We call them bags and bugs. As examples of problems where bags and bugs appear, we show that balanced bugs maximize the index of graphs with fixed number of vertices and diameter ≥ 2, while odd bags maximize the index of graphs with fixed number of vertices and radius ≥ 3.en
dc.publisherElsevier-
dc.relationSerbian Ministry of Science, Grant 1227-
dc.relation.ispartofDiscrete Applied Mathematicsen
dc.subjectBags | Bugs | Diameter | Extremal graphs | Graph | Index | Radiusen
dc.titleOn bags and bugsen
dc.typeArticleen
dc.identifier.doi10.1016/j.dam.2007.05.044en
dc.identifier.scopus2-s2.0-40349098099en
dc.relation.firstpage986en
dc.relation.lastpage997en
dc.relation.issue7en
dc.relation.volume156en
dc.description.rankM22-
item.openairetypeArticle-
item.fulltextNo Fulltext-
item.grantfulltextnone-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.cerifentitytypePublications-
crisitem.author.orcid0000-0003-2908-305X-
Show simple item record

SCOPUSTM   
Citations

29
checked on Nov 28, 2022

Page view(s)

18
checked on Nov 28, 2022

Google ScholarTM

Check

Altmetric

Altmetric


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