• DocumentCode
    1442633
  • Title

    On upper bounds in tree-diameter sets of graphs

  • Author

    Shibata, Yukio ; Fukue, Susumu

  • Author_Institution
    Dept. of Comput. Sci., Gunma Univ., Japan
  • Volume
    36
  • Issue
    6
  • fYear
    1989
  • fDate
    6/1/1989 12:00:00 AM
  • Firstpage
    905
  • Lastpage
    907
  • Abstract
    An upper bound in tree-diameter sets of connected graphs is given. Let S {a1, a2, . . ., an} be the tree-diameter set of a connected graph G in increasing order. It is proved that ai+1 ⩽a1+(1/2)a1 1⩽i⩽n-1
  • Keywords
    graph theory; trees (mathematics); connected graphs; tree-diameter sets; upper bounds; Circuits and systems; Digital filters; Error correction; Gradient methods; Information analysis; Iterative methods; Multidimensional signal processing; Optimization methods; Speech processing; Tree graphs;
  • fLanguage
    English
  • Journal_Title
    Circuits and Systems, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0098-4094
  • Type

    jour

  • DOI
    10.1109/31.90415
  • Filename
    90415
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1442633