• DocumentCode
    1193212
  • Title

    On the feasible tree-diameter sets of graphs

  • Author

    Shimizu, Toshihiko ; Shibata, Yukio

  • Volume
    32
  • Issue
    8
  • fYear
    1985
  • fDate
    8/1/1985 12:00:00 AM
  • Firstpage
    862
  • Lastpage
    864
  • Abstract
    A proof is given for the conjecture on feasible tree-diameter sets of graphs given by Harary et al. [2]. Some additional properties on feasible tree-diameter sets are studied.
  • Keywords
    Trees; Band pass filters; Chebyshev approximation; Computer science; Delay; Digital filters; Graph theory; Minimax techniques; Speech processing; Terminology; Tree graphs;
  • fLanguage
    English
  • Journal_Title
    Circuits and Systems, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0098-4094
  • Type

    jour

  • DOI
    10.1109/TCS.1985.1085785
  • Filename
    1085785
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1193212