On upper bounds in tree-diameter sets of graphs

被引:0
|
作者
Shibata, Yukio [1 ]
Fukue, Susumu [1 ]
机构
[1] Gumma Univ, Gumma, Jpn
来源
关键词
4;
D O I
暂无
中图分类号
学科分类号
摘要
引用
收藏
页码:905 / 907
相关论文
共 50 条
  • [1] ON UPPER-BOUNDS IN TREE-DIAMETER SETS OF GRAPHS
    SHIBATA, Y
    FUKUE, S
    IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS, 1989, 36 (06): : 905 - 907
  • [2] ON THE FEASIBLE TREE-DIAMETER SETS OF GRAPHS
    SHIMIZU, T
    SHIBATA, Y
    IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS, 1985, 32 (08): : 862 - 864
  • [3] Upper bounds on sets of orthogonal colorings of graphs
    Ballif, Serge C.
    DISCRETE MATHEMATICS, 2013, 313 (20) : 2195 - 2205
  • [4] Upper bounds for the domination number in graphs of diameter two
    Meierling, Dirk
    Volkmann, Lutz
    UTILITAS MATHEMATICA, 2014, 93 : 267 - 277
  • [5] UPPER-BOUNDS FOR THE DIAMETER AND HEIGHT OF GRAPHS OF CONVEX POLYHEDRA
    KALAI, G
    DISCRETE & COMPUTATIONAL GEOMETRY, 1992, 8 (04) : 363 - 372
  • [6] Sharp upper bounds for Zagreb indices of bipartite graphs with a given diameter
    Faculty of Mathematics and Statistics, Central China Normal University, Wuhan 430079, China
    不详
    Appl Math Lett, 2 (131-137):
  • [7] Sharp upper bounds for Zagreb indices of bipartite graphs with a given diameter
    Li, Shuchao
    Zhang, Minjie
    APPLIED MATHEMATICS LETTERS, 2011, 24 (02) : 131 - 137
  • [8] Tight Upper Bounds for Minimum Feedback Arc Sets of Regular Graphs
    Hanauer, Kathrin
    Brandenburg, Franz J.
    Auer, Christopher
    GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, WG 2013, 2013, 8165 : 298 - 309
  • [9] Diameter bounds for planar graphs
    Fulek, Radoslav
    Moric, Filip
    Pritchard, David
    DISCRETE MATHEMATICS, 2011, 311 (05) : 327 - 335
  • [10] Sharp upper bounds for multiplicative Zagreb indices of bipartite graphs with given diameter
    Wang, Chunxiang
    Liu, Jia-Bao
    Wang, Shaohui
    DISCRETE APPLIED MATHEMATICS, 2017, 227 : 156 - 165