Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
10678411 | Applied Mathematics Letters | 2005 | 11 Pages |
Abstract
Classification 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.
Related Topics
Physical Sciences and Engineering
Engineering
Computational Mechanics
Authors
Stefan Grünewald, Dragan StevanoviÄ,