Maximum genus, independence number and girth

被引:0
|
作者
Yuanqiu H. [1 ]
Yanpei L. [2 ]
机构
[1] Department of Mathematics, Normal University of Hunan, Changsha
[2] Department of Mathematics, Northern Jiaotong University, Beijing
关键词
1991 MR Subject Classification: 05C; Betti deficiency; Girth; Independence number; Maximum genus; O157.5;
D O I
10.1007/BF02731961
中图分类号
学科分类号
摘要
It is known (for example see [2]) that the maximum genus of a graph is mainly determined by the Betti deficiency of the graph. In this paper, the authors establish an upper bound on the Betti deficiency in terms of the independence number as well as the girth of a graph, and thus use the formulation in [2] to translate this result to lower bound on the maximum genus. Meantime it is shown that both of the bounds are best possible. © 1983 Shanghai Scientific & Technological Literature Publishing House.
引用
收藏
页码:77 / 82
页数:5
相关论文
共 50 条
  • [31] Girth and fractional chromatic number of planar graphs
    Pirnazar, A
    Ullman, DH
    JOURNAL OF GRAPH THEORY, 2002, 39 (03) : 201 - 217
  • [32] On the spectral radius of graphs with given maximum degree and girth
    Ai, Jiangdong
    Im, Seonghyuk
    Kim, Jaehoon
    Lee, Hyunwoo
    Suil, O.
    Zhang, Liwen
    LINEAR ALGEBRA AND ITS APPLICATIONS, 2024, 691 : 182 - 195
  • [33] Oriented diameter of graphs with given girth and maximum degree
    Chen, Bin
    Chang, An
    DISCRETE MATHEMATICS, 2023, 346 (04)
  • [34] A relative maximum genus graph embedding and its local maximum genus
    Li Deming
    Liu Yanpei
    Acta Mathematicae Applicatae Sinica, 2000, 16 (4) : 366 - 372
  • [35] Rainbow Connection Number and Independence Number of a Graph
    Jiuying Dong
    Xueliang Li
    Graphs and Combinatorics, 2016, 32 : 1829 - 1841
  • [36] On the chromatic number and independence number of hypergraph products
    Mubayi, Dhruv
    Rodl, Vojtech
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2007, 97 (01) : 151 - 155
  • [37] Rainbow Connection Number and Independence Number of a Graph
    Dong, Jiuying
    Li, Xueliang
    GRAPHS AND COMBINATORICS, 2016, 32 (05) : 1829 - 1841
  • [38] Maximum genus, connectivity and minimal degree of graphs
    Huang, YQ
    Zhao, TL
    DISCRETE MATHEMATICS, 2005, 300 (1-3) : 110 - 119
  • [39] On the Maximum Number of Maximum Independent Sets
    Mohr, E.
    Rautenbach, D.
    GRAPHS AND COMBINATORICS, 2018, 34 (06) : 1729 - 1740
  • [40] On the Maximum Number of Maximum Independent Sets
    E. Mohr
    D. Rautenbach
    Graphs and Combinatorics, 2018, 34 : 1729 - 1740