Sciweavers

Share
APPML
2005

Semiharmonic bicyclic graphs

8 years 10 months ago
Semiharmonic bicyclic graphs
Let the trunk of a graph G be the graph obtained by removing all leaves of G. We prove that, for every integer c 2, there are at most finitely many trunks of semiharmonic graphs with cyclomatic number c -- in contrast to the fact established by the last two of the present authors in their paper Semiharmonic Bicyclic Graphs (this journal) that there are infinitely many connected semiharmonic graphs with given cyclomatic number. Further, we prove that there are at most finitely many semiharmonic but not almost semiregular graphs with cyclomatic number c. MSC Classification: 05C75
Stefan Grünewald, Dragan Stevanovic
Added 15 Dec 2010
Updated 15 Dec 2010
Type Journal
Year 2005
Where APPML
Authors Stefan Grünewald, Dragan Stevanovic
Comments (0)
books