language-icon Old Web
English
Sign In

Semiharmonic bicyclic graphs

2005 
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.
    • Correction
    • Source
    • Cite
    • Save
    • Machine Reading By IdeaReader
    10
    References
    4
    Citations
    NaN
    KQI
    []