Semiharmonic graphs with fixed cyclomatic number

被引:6
作者
Dress, A
Grünewald, S
Stevanovic, D
机构
[1] Univ Bielefeld, Forsch Schwerpunkt Mathematisierung, D-33501 Bielefeld, Germany
[2] Uppsala Univ, Linnaeus Ctr Bioinformat, S-75124 Uppsala, Sweden
[3] Fac Sci & Math, Dept Math, YU-18000 Nish, Serbia
关键词
harmonic graphs; semiharmonic graphs; almost semiregular graphs; cyclomatic number;
D O I
10.1016/S0893-9659(04)90096-1
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
Let the trunk of a graph G be the graph obtained by removing all leaves of G. We prove that, for every integer c greater than or equal to 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. (C) 2004 Elsevier Ltd. All rights reserved.
引用
收藏
页码:623 / 629
页数:7
相关论文
共 5 条
[1]   Harmonic graphs with small number of cycles [J].
Borovicanin, B ;
Grünewald, S ;
Gutman, I ;
Petrovic, M .
DISCRETE MATHEMATICS, 2003, 265 (1-3) :31-44
[2]   Semiharmonic trees and monocyclic graphs [J].
Dress, A ;
Grünewald, S .
APPLIED MATHEMATICS LETTERS, 2003, 16 (08) :1329-1332
[3]  
DRESS A, IN PRESS ANN COMB
[4]   Harmonic trees [J].
Grünewald, S .
APPLIED MATHEMATICS LETTERS, 2002, 15 (08) :1001-1004
[5]  
GRUNEWALD S, IN PRESS APPL MATH L