G-2005-44
Variable Neighborhood Search for Extremal Graphs. 15. On Bags and Bugs
et référence BibTeX
Usual 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.
Paru en mai 2005 , 22 pages
Axes de recherche
Applications de recherche
Publication
jan. 2008
On bags and bugs
et
Discrete Applied Mathematics, 156(7), 986–997, 2008
référence BibTeX